Pages that link to "Item:Q1909973"
From MaRDI portal
The following pages link to The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams (Q1909973):
Displaying 6 items.
- Generating Hamiltonian circuits without backtracking from errors (Q1334673) (← links)
- Bounds on the number of knight's tours (Q1356517) (← links)
- Counting moves in knight's tours (Q1408184) (← links)
- Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
- Book review of: J. Sesiano, Euler et le parcours du cavalier. Avec une annexe sur le théorème des polyèdres (Q1684360) (← links)
- Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)