Two-player tower of Hanoi

DOI10.1007/S00182-017-0608-4MaRDI QIDQ1791283zbMATH OpenOpenAlexFDO

Authors Jonathan Chappelon, Urban Larsson, Akihiro Matsuura

Publication date 4 October 2018

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.03345

zbMATH Keywords

combinatorial gametower of Hanoiscoring play

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

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

Recommendations

• The fourth tower of Hanoi
• scientific article; zbMATH DE number 2168836
• The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
• Generalized multi-peg tower of hanoi problem
• scientific article; zbMATH DE number 1439478

Cites work

• scientific article; zbMATH DE number 5145315 (Why is no real title available?)
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 3521877 (Why is no real title available?)
• scientific article; zbMATH DE number 3078996 (Why is no real title available?)
• A metric for positional games
• Adjudicating a towers of hanoi contest†
• Combinatorial game theory
• Games with guaranteed scores and waiting moves
• Games, puzzles, and computation
• Graphs and composite games
• Guaranteed scoring games
• Loopy Games
• On generalized Frame-Stewart numbers
• Playing games with algorithms: algorithmic combinatorial game theory
• Shortest paths between regular states of the Tower of Hanoi
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• The combinatorial game theory of well-tempered scoring games
• The fourth tower of Hanoi
• The generalized Sprague-Grundy function and its invariance under certain mappings

Cited in

(3)

• Two-player knock 'em down
• The tree search game for two players
• Counter examples to adjudicating a towers of hanoi contest

This page was built for publication: Two-player tower of Hanoi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791283)