Pages that link to "Item:Q3668869"
From MaRDI portal
The following pages link to Adjudicating a towers of hanoi contest† (Q3668869):
Displayed 15 items.
- The number of moves of the largest disc in shortest paths on Hanoi graphs (Q490248) (← links)
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles (Q730903) (← links)
- The diameter of Hanoi graphs (Q844161) (← links)
- A general algorithm for finding a shortest path between two n- configurations (Q1098292) (← links)
- Shortest paths between regular states of the Tower of Hanoi (Q1193833) (← links)
- Four encounters with Sierpiński's gasket (Q1343282) (← links)
- Two-player tower of Hanoi (Q1791283) (← links)
- Parallelism for multipeg towers of Hanoi (Q1804221) (← links)
- The complexity of an optimal algorithm for the generalized tower of hanoi problem (Q3479521) (← links)
- Towers of hanoi graphs (Q3803164) (← links)
- Counter examples to adjudicating a towers of hanoi contest (Q3804210) (← links)
- Towers of hanoi problem with arbitrary<i>k</i>≧3 pages (Q3806843) (← links)
- A statistical analysis of the towers of hanoi problem (Q3815308) (← links)
- A loopless approach to the multipeg towers of hanoi (Q4009743) (← links)
- Random walks on dual Sierpinski gaskets (Q6176639) (← links)