A general algorithm for finding a shortest path between two n- configurations (Q1098292)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A general algorithm for finding a shortest path between two n- configurations |
scientific article; zbMATH DE number 4037192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general algorithm for finding a shortest path between two n- configurations |
scientific article; zbMATH DE number 4037192 |
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
