IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v47y2018i2d10.1007_s00182-017-0608-4.html
   My bibliography  Save this article

Two-player Tower of Hanoi

Author

Listed:
  • Jonathan Chappelon

    (Univ. Montpellier)

  • Urban Larsson

    (Dalhousie University)

  • Akihiro Matsuura

    (Tokyo Denki University)

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

Suggested Citation

  • Jonathan Chappelon & Urban Larsson & Akihiro Matsuura, 2018. "Two-player Tower of Hanoi," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(2), pages 463-486, May.
    • Handle: RePEc:spr:jogath:v:47:y:2018:i:2:d:10.1007_s00182-017-0608-4
    DOI: 10.1007/s00182-017-0608-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-017-0608-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00182-017-0608-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Will Johnson, 2014. "The combinatorial game theory of well-tempered scoring games," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(2), pages 415-438, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ravi Kant Rai & Urban Larsson & Neel Patel, 2021. "Discrete Richman-bidding scoring games," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(3), pages 695-728, September.
    2. Eric Duchêne & Matthieu Dufour & Silvia Heubach & Urban Larsson, 2016. "Building Nim," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(4), pages 859-873, November.
    3. Urban Larsson & Richard J. Nowakowski & Carlos P. Santos, 2018. "Games with guaranteed scores and waiting moves," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(2), pages 653-671, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:47:y:2018:i:2:d:10.1007_s00182-017-0608-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.