Pages that link to "Item:Q3219130"

The following pages link to An iterative algorithm for the cyclic Towers of Hanoi problem (Q3219130):

Displaying 9 items.

• Computational solution of an old tower of Hanoi problem (Q327694) (← links)
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant (Q477330) (← links)
• Derivation of efficient programs for computing sequences of actions (Q1093362) (← links)
• A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc (Q1116691) (← links)
• An iterative algorithm for the Tower of Hanoi with four pegs (Q1119589) (← links)
• Note on the cyclic towers of Hanoi (Q1314396) (← links)
• The complexity of the generalised cyclic Towers of Hanoi problem (Q3696520) (← links)
• The Cyclic Towers of Hanoi and Pseudo Ternary Codes (Q3742739) (← links)
• Short Notes: A Fast Algorithm for the Towers of Hanoi Problem (Q3799633) (← links)