The Colour Towers of Hanoi – An Iterative Solution (Q3330528): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The cyclic towers of Hanoi / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Towers of Hanoi Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Representation Approach to the Tower of Hanoi Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discussion and correspondence: A note on the Towers of Hanoi problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The towers of Hanoi revisited: Moving the rings by counting the moves / rank | |||
Normal rank | |||
Latest revision as of 13:16, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Colour Towers of Hanoi – An Iterative Solution |
scientific article |
Statements
The Colour Towers of Hanoi – An Iterative Solution (English)
0 references
1984
0 references
iterative algorithm
0 references
colour Towers of Hanoi problem
0 references
