Opis: 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 graphs ▫$H_p^n$▫ in a more general setting. Here ▫$p$▫ stands for the number of pegs and ▫$n$▫ for the number of discs in the Tower of Hanoi interpretation of these graphs. The analysis depends crucially on the number of largest disc moves (LDMs). The patterns of these LDMs will be coded as binary strings of length ▫$p-1$▫ assigned to each pair of starting and goal states individually. This will be approached both analytically and numerically. The main theoretical achievement is the existence, at least for all ▫$n \geqslant p(p-2)$▫, of optimal paths where ▫$p-1$▫ LDMs are necessary. Numerical results, obtained by an algorithm based on a modified breadth-first search making use of symmetries of the graphs, lead to a couple of conjectures about some cases not covered by our ascertained results. These, in turn, may shed some light on the notoriously open FSC. Ključne besede:graph theory, Tower of Hanoi, Hanoi graphs, shortest paths, symmetries, breadth-first search Objavljeno: 14.08.2017; Ogledov: 130; Prenosov: 4 Celotno besedilo (376,70 KB)