Two-player tower of Hanoi
From MaRDI portal
Publication:1791283
DOI10.1007/s00182-017-0608-4zbMath1416.91055arXiv1503.03345OpenAlexW1892351060MaRDI QIDQ1791283
Urban Larsson, Akihiro Matsuura, Jonathan Chappelon
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Guaranteed scoring games
- On generalized Frame-Stewart numbers
- The generalized Sprague-Grundy function and its invariance under certain mappings
- Shortest paths between regular states of the Tower of Hanoi
- Games with guaranteed scores and waiting moves
- A metric for positional games
- The fourth tower of Hanoi
- The combinatorial game theory of well-tempered scoring games
- The Tower of Hanoi – Myths and Maths
- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
- Adjudicating a towers of hanoi contest†
- Loopy Games
- Graphs and composite games
This page was built for publication: Two-player tower of Hanoi