The formulation and partial solution of a hide-and-seek game. The hider chooses an integer from 1 to n; the hunter makes a guess, and is told whether he is too high or too low. The process is repeated until he has guessed correctly. The payoff is the expected number of guesses. Possible practical applications include the problem of correctly weighing an object within expected number of weighings on a balance scale playing against nature.
This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.
Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.