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

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

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

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 graphs; Tower of Hanoi; computerized test; psychological test; Tower of London

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

91E45: Measurement and performance in psychology

Related Items

A survey and classification of Sierpiński-type graphs, The average eccentricity of Sierpiński 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