In an earlier paper, we studied the problem of guessing a random vector X within distortion D, and characterized the best attainable exponent E(D; ) of the th moment of the number of required guesses G(X) until the guessing error falls below D. In this paper, we extend these results to a multi-stage, hierarchical guessing model, which allows for a faster search of a codeword vector at the encod...