Three variations on the Massey-Arikan guessing problem are considered. Their solutions provide new evidence of the duality between good guessing functions and efficient quantization schemes. They also show how type-covering can be used to provide side-information in the guessing setup.