Pages that link to "Item:Q4962337"
From MaRDI portal
The following pages link to A method for finding Hamilton paths and Knight's tours (Q4962337):
Displaying 6 items.
- A practical approach to the chromatic partition problem (Q1212946) (← links)
- Solution of the knight's Hamiltonian path problem on chessboards (Q1326749) (← links)
- Generating Hamiltonian circuits without backtracking from errors (Q1334673) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- Algorithms for finding knight's tours on Aztec diamonds (Q2357657) (← links)
- Traveling in Networks with Blinking Nodes (Q5225540) (← links)