Pages that link to "Item:Q1098292"
From MaRDI portal
The following pages link to A general algorithm for finding a shortest path between two n- configurations (Q1098292):
Displaying 4 items.
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles (Q730903) (← links)
- Shortest paths between regular states of the Tower of Hanoi (Q1193833) (← links)
- Four encounters with Sierpiński's gasket (Q1343282) (← links)
- The complexity of an optimal algorithm for the generalized tower of hanoi problem (Q3479521) (← links)
