Pages that link to "Item:Q1193833"
From MaRDI portal
The following pages link to Shortest paths between regular states of the Tower of Hanoi (Q1193833):
Displaying 11 items.
- An efficient algorithm to determine all shortest paths in Sierpiński graphs (Q406332) (← links)
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles (Q730903) (← links)
- Shortest paths in Sierpiński graphs (Q741754) (← links)
- Four encounters with Sierpiński's gasket (Q1343282) (← links)
- On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem (Q1613371) (← links)
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence (Q1775033) (← links)
- Two-player tower of Hanoi (Q1791283) (← links)
- Distances in Sierpiński graphs and on the Sierpiński gasket (Q2375905) (← links)
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem (Q4209980) (← links)
- Distance-Uniform Graphs with Large Diameter (Q5232139) (← links)
- Random walks on dual Sierpinski gaskets (Q6176639) (← links)
