Pages that link to "Item:Q1763476"
From MaRDI portal
The following pages link to Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476):
Displaying 8 items.
- Generalized knight's tour on 3D chessboards (Q602746) (← links)
- Generating Hamiltonian circuits without backtracking from errors (Q1334673) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- Algorithms for finding knight's tours on Aztec diamonds (Q2357657) (← links)
- (Q3797190) (← links)
- A method for finding Hamilton paths and Knight's tours (Q4962337) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q6487568) (← links)