Pages that link to "Item:Q1613371"

The following pages link to On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem (Q1613371):

Displayed 12 items.

• Computational solution of an old tower of Hanoi problem (Q327694) ‎ (← links)
• Sierpiński graphs as spanning subgraphs of Hanoi graphs (Q352716) ‎ (← links)
• The tower of Hanoi problem on Path\(_h\) graphs (Q427887) ‎ (← links)
• Growth of Schreier graphs of automaton groups. (Q453409) ‎ (← links)
• The number of moves of the largest disc in shortest paths on Hanoi graphs (Q490248) ‎ (← links)
• On generalized Frame-Stewart numbers (Q764868) ‎ (← links)
• Hanoi graphs and some classical numbers (Q813952) ‎ (← links)
• The diameter of Hanoi graphs (Q844161) ‎ (← links)
• Santa Claus' Towers of Hanoi (Q2373436) ‎ (← links)
• Asymptotic aspects of Schreier graphs and Hanoi Towers groups. (Q2499644) ‎ (← links)
• Exponential vs. Subexponential Tower of Hanoi Variants (Q2971384) ‎ (← links)
• What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? (Q4621297) ‎ (← links)