Computational solution of an old tower of Hanoi problem (Q327694)
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: Computational solution of an old tower of Hanoi problem |
scientific article; zbMATH DE number 6640923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational solution of an old tower of Hanoi problem |
scientific article; zbMATH DE number 6640923 |
Statements
Computational solution of an old tower of Hanoi problem (English)
0 references
19 October 2016
0 references
tower of Hanoi
0 references
graph distance
0 references
integer sequences
0 references
breadth-first search
0 references
0.9084828
0 references
0.87517744
0 references
0 references
0.8708401
0 references
0.86937684
0 references
0.8693216
0 references
0.8679465
0 references
