A general algorithm for finding a shortest path between two n- configurations (Q1098292): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 14:53, 18 June 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
