A general algorithm for finding a shortest path between two n- configurations (Q1098292): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| 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
