Pages that link to "Item:Q1326749"
From MaRDI portal
The following pages link to Solution of the knight's Hamiltonian path problem on chessboards (Q1326749):
Displaying 15 items.
- An efficient algorithm for the Knight's tour problem (Q678854) (← links)
- Über Rösselringe auf dem Brett von \(6^ 2\) Zellen. (On knight's rings on the chessboard of \(6^ 2\) cells) (Q810513) (← links)
- Knight's moves, graphs, and lattices (Q1326526) (← links)
- Generating Hamiltonian circuits without backtracking from errors (Q1334673) (← links)
- Bounds on the number of knight's tours (Q1356517) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476) (← links)
- The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams (Q1909973) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- Game chromatic number of strong product graphs (Q2092388) (← links)
- Algorithms for finding knight's tours on Aztec diamonds (Q2357657) (← links)
- Hamiltonian paths in m x n projective checkerboards (Q3299354) (← links)
- Laceable knights (Q3466850) (← links)
- A method for finding Hamilton paths and Knight's tours (Q4962337) (← links)
- A tour problem on a toroidal board (Q5109060) (← links)