A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles

DOI10.1016/j.ins.2009.04.010zbMath1180.68201OpenAlexW1999051146MaRDI QIDQ730903

Andreas M. Hinz, Anton Kostov, Fabian Kneißl, Adrian Danek, Fatma Sürer

Publication date: 1 October 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.04.010

zbMATH Keywords

state graphsTower of Hanoicomputerized testpsychological testTower of London

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Measurement and performance in psychology (91E45)

Related Items (4)

The Dudeney-Stockmeyer conjecture ⋮ The average eccentricity of Sierpiński graphs ⋮ The Hanoi graph \(H_4^3\) ⋮ A survey and classification of Sierpiński-type graphs

Uses Software

• HANOIPC3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the planarity of Hanoi graphs
• A general algorithm for finding a shortest path between two n- configurations
• Shortest paths between regular states of the Tower of Hanoi
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The tower of Hanoi
• Santa Claus' Towers of Hanoi
• Linear-time disk-based implicit graph search
• Adjudicating a towers of hanoi contest†
• Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles