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.
Johnson, Selmer Martin, A Search Game. Santa Monica, CA: RAND Corporation, 1964. https://www.rand.org/pubs/research_memoranda/RM3717.html. Also available in print form.
Johnson, Selmer Martin, A Search Game, RAND Corporation, RM-3717-PR, 1964. As of December 8, 2023: https://www.rand.org/pubs/research_memoranda/RM3717.html