Advertisement

International Journal of Game Theory

, Volume 47, Issue 2, pp 463–486 | Cite as

Two-player Tower of Hanoi

  • Jonathan Chappelon
  • Urban Larsson
  • Akihiro Matsuura
Original Paper
  • 166 Downloads

Abstract

The Tower of Hanoi game is a classical puzzle in recreational mathematics (Lucas 1883) which also has a strong record in pure mathematics. In a borderland between these two areas we find the characterization of the minimal number of moves, which is \(2^n-1\), to transfer a tower of n disks. But there are also other variations to the game, involving for example real number weights on the moves of the disks. This gives rise to a similar type of problem, but where the final score seeks to be optimized. We study extensions of the one-player setting to two players, invoking classical winning conditions in combinatorial game theory such as the player who moves last wins, or the highest score wins. Here we solve both these winning conditions on three pegs.

Keywords

Combinatorial game Scoring play Tower of Hanoi 

Mathematics Subject Classification

91A46 

Notes

Acknowledgements

We thank the anonymous referees for their comments and suggestions.

References

  1. Albert MH, Nowakowski RJ, Wolfe D (2007) Lessons in play: an introduction to combinatorial game theory. Peters/CRC Press, Wellesley, A.KGoogle Scholar
  2. Berlekamp ER, Conway JH, Guy RK (2001) Winning ways for your mathematical plays, 1–2, Academic Press, London (1982), Second edition, pp. 1–4. A.K. Peters, WellesleyGoogle Scholar
  3. Bousch T (2014) La quatrième tour de Hanoï. Bull Belg Math Soc Simon Stevin 21:895–912Google Scholar
  4. Chappelon J, Matsuura A (2012) Generalized Frame-Stewart numbers. Discret Math 312:830–836Google Scholar
  5. Conway JH (1976) On numbers and games. Academic, New YorkGoogle Scholar
  6. Conway JH (1978) Loopy games. In: Bollobás B (ed) Advances in graph theory, number 3 in Ann. Discrete Math., pp 55–74Google Scholar
  7. Demaine ED, Hearn RA (2009a) Games, puzzles, and computation. A.K, Peters, WellesleyCrossRefGoogle Scholar
  8. Demaine ED, Hearn RA (2009b) Playing games with algorithms: algorithmic combinatorial game theory. In: Albert MH, Nowakowski RJ (eds) Games of no chance 3, MSRI Publications, vol 56. Cambridge University Press, Cambridge, pp 3–56CrossRefGoogle Scholar
  9. Ettinger M (1996) Topics in combinatorial games, Phd Thesis, University of WisconsinGoogle Scholar
  10. Ettinger M (2000) A metric for positional games. Theoret Comput Sci 230:207–219CrossRefGoogle Scholar
  11. Fraenkel AS, Yesha Y (1986) The generalized Sprague-Grundy function and its invariance under certain mappings. J Combin Theory Ser A 43:165–177CrossRefGoogle Scholar
  12. Hinz AM (1992) Shortest paths between regular states of the Tower of Hanoi. Inf Sci 63:173–181CrossRefGoogle Scholar
  13. Hinz AM, Klavžar S, Milutinović U, Petr C (2013) The Tower of Hanoi-Myths and Maths. Birkhäuser, BaselCrossRefGoogle Scholar
  14. Johnson W (2014) The combinatorial game theory of well-tempered scoring games. Int J Game Theory 43:415–438CrossRefGoogle Scholar
  15. Larsson U, Neto JP, Nowakowski RJ, Santos CP (2016) Guaranteed scoring games. Electron J Combin 23(3):27Google Scholar
  16. Larsson U, Nowakowski RJ, Santos CP (2017) Games with guaranteed scores and waiting moves. Int J Game Theory.  https://doi.org/10.1007/s00182-017-0590-x
  17. Matsuura A (2011) Analysis of recurrence relations generalized from the 4-peg Tower of Hanoi. IEICE Trans Inf Syst E94-D:220–225Google Scholar
  18. Matsuura A, Nishimaki S (2011) The Tower of Hanoi with weighted cost. In: Integers conference 2011, Abstracts, University of West Georgia, Carrollton, Georgia, p 13Google Scholar
  19. Milnor J (1953) Sums of positional games. Contributions to the Theory of Games II. Princeton University Press, Princeton, pp 291–301Google Scholar
  20. Siegel AN (2013) Combinatorial game theory. Am Math SocGoogle Scholar
  21. Singmaster D (2017) An historical tour of binary and tours. In Larsson U (ed) Games of no Chance 5. MSRI Publications, Cambridge University Press, Cambridge (accepted)Google Scholar
  22. Smith CAB (1966) Graphs and composite games. J Combin Theory Ser A 1:51–81CrossRefGoogle Scholar
  23. Stewart F (2011) Scoring Play Combinatorial Games, Phd Thesis, University of Dundee . Also a paper with the same title, to appear in U. Larsson (Ed.), Games of no Chance 5, MSRI Publications, Cambridge University Press, CambridgeGoogle Scholar
  24. Wood D (1983) Adjudicating a Towers of Hanoi contest. Int J Comput Math 14:199–207CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2017

Authors and Affiliations

  1. 1.Institut Montpelliérain Alexander Grothendieck, CNRSUniv. MontpellierMontpellierFrance
  2. 2.Department of Mathematics and StatisticsDalhousie UniversityHalifaxCanada
  3. 3.Division of Information System Design, School of Science and EngineeringTokyo Denki UniversitySaitamaJapan

Personalised recommendations