The Number of Moves of the Largest Disc in Shortest Paths on Hanoi Graphs

Electronic Journal Of Combinatorics

Simon Aumann¹ 

关键词: Tower of Hanoi;    Hanoi graphs;    shortest paths;    symmetries;    breadth-first search;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In contrast to the widespread interest in the Frame-Stewart conjecture (FSC) about the optimal number of moves in the classical Tower of Hanoi task with more than three pegs, this is the first study of the question of investigating shortest paths in Hanoi

【 授权许可】

Others