We discuss two classic search games: Isaacs’ princess and monster game, and Dresher’s high-low guessing game. Despite the fact that these games were introduced decades ago, there are still numerous open problems around them.
KeywordsMixed Strategy Pure Strategy Strategy Space Binary Search Tree Arbitrary Initial Point
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 4.A. Bonato, R.J. Nowakowski, The game of cops and robbers on graphs, American Mathematical Society, 2011.Google Scholar
- 5.M. Dresher, Games of Strategy: theory and application, Prentice Hall, 1961.Google Scholar
- 8.R.J. Fokkink, M. Stassen, An asymptotic solution of Dresher’s guessing game, Gamesec 2011, LNCS 7037 (2011), 104–116.Google Scholar
- 10.L. Geupel, The ‘Princess and Monster’ Game on an Interval, BSc thesis, TU München (2011), http://en.wikipedia.org/wiki/Princess_and_monster_game
- 13.S. Johnson, A search game, in Advances in Game Theory, M. Dresher, L.S. Shapley, A.W. Tucker (eds), Princeton University press, Princeton 1964, 39–48.Google Scholar
- 14.J.E. Littlewood, A mathematician’s miscellany, ed. B. Bollobás, Cambridge University Press, 1986.Google Scholar
© Springer Science+Business Media New York 2013