On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem (Q1613371): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4096952 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4745277 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An iterative algorithm for the Tower of Hanoi with four pegs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest paths between regular states of the Tower of Hanoi / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The generalized<sub>p</sub>peg tower of hanoi problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3946175 / rank | |||
Normal rank | |||
Revision as of 15:22, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem |
scientific article |
Statements
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem (English)
0 references
29 August 2002
0 references
multi-peg tower of Hanoi problem
0 references
Frame-Stewart algorithm
0 references
recursion
0 references
dynamic programming
0 references
