The following pages link to (Q5724751):
Displaying 6 items.
- An efficient algorithm for the Knight's tour problem (Q678854) (← links)
- Shortest paths between regular states of the Tower of Hanoi (Q1193833) (← links)
- A new heap game (Q1589501) (← links)
- Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476) (← links)
- Characterization of the set of values \(f(n)=[n \alpha ], n=1,2,\dots \) (Q2555512) (← links)
- A generalization of Wythoff's game (Q2562046) (← links)
