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 profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:12, 5 March 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
