A Search Game

Selmer Martin Johnson

ResearchPublished 1964

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.

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1964
  • Pages: 20
  • Document Number: RM-3717-PR

Citation

Chicago Manual of Style

Johnson, Selmer Martin, A Search Game. Santa Monica, CA: RAND Corporation, 1964. https://www.rand.org/pubs/research_memoranda/RM3717.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND 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.