The following pages link to (Q4172083):
Displaying 4 items.
- An efficient algorithm for the Knight's tour problem (Q678854) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- Generalized knight's tours on rectangular chessboards (Q2565852) (← links)