Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2004.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058686974 / rank | |||
Normal rank | |||
Revision as of 19:41, 19 March 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
