Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards (Q1763476): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5784990 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4055298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of the knight's Hamiltonian path problem on chessboards / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5724751 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Knight's Tour on the 15-Puzzle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for the Knight's tour problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4881929 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Which Rectangular Chessboards Have a Knight's Tour? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4297764 / rank | |||
Normal rank | |||
Latest revision as of 17:24, 7 June 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
