Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:20, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards |
scientific article |
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
