Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards |
scientific article; zbMATH DE number 2136333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards |
scientific article; zbMATH DE number 2136333 |
Statements
Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (English)
0 references
22 February 2005
0 references
Divide-and-conquer algorithm
0 references
Knight's tour problem
0 references
Optimal algorithm
0 references
