A general algorithm for finding a shortest path between two n- configurations (Q1098292): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Towers of Hanoi Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Representation Approach to the Tower of Hanoi Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discussion and correspondence: A note on the Towers of Hanoi problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Adjudicating a towers of hanoi contest† / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0255(87)90020-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976266588 / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general algorithm for finding a shortest path between two n- configurations |
scientific article |
Statements
A general algorithm for finding a shortest path between two n- configurations (English)
0 references
1987
0 references
shortest path between two n-configurations
0 references
generalized Towers of Hanoi contest
0 references
