A general algorithm for finding a shortest path between two n-configurations
Information Sciences: an International Journal
Graph Theory, 1736-1936
Shortest paths between regular states of the tower of Hanoi
Information Sciences: an International Journal
Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
European Journal of Combinatorics
Human Problem Solving
Tracing Problem Solving in Real Time: fMRI Analysis of the Subject-paced Tower of Hanoi
Journal of Cognitive Neuroscience
A computational model of tower of hanoi problem solving
A computational model of tower of hanoi problem solving
Shortest Paths in the Tower of Hanoi Graph and Finite Automata
SIAM Journal on Discrete Mathematics
Graphs and Combinatorics
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
ACM Transactions on Algorithms (TALG)
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
HANOIPC3: A computer program to evaluate executive functions
Computer Methods and Programs in Biomedicine
Recent progress in heuristic search: a case study of the four-peg towers of Hanoi problem
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hi-index | 0.07 |
We propose a mathematical model for the Towers of Hanoi and London based on state graphs. The analysis of this model allows to address questions like equivalence of puzzles, difficulty of tasks and optimality of solutions using topological, metric and symmetry properties of the corresponding graphs. The mathematical model serves as a base for a computer program to administer tower puzzles in a variety of psychological test situations. It is suitable for bedside use and is equipped with numerous devices for post-processing of recorded data. Among these features is the graphical representation of the projection of the path taken by a test person onto the state graph.