The generalizedppeg tower of hanoi problem
From MaRDI portal
Publication:4764584
Recommendations
Cited in
(17)- The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem
- Towers of hanoi problem with arbitraryk≧3 pages
- On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
- Exact analysis of the recurrence relations generalized from the Tower of Hanoi
- The fourth tower of Hanoi
- The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
- A new lower bound for the Towers of Hanoi problem
- On a recurrence relation related to the Reve's puzzle
- scientific article; zbMATH DE number 5485303 (Why is no real title available?)
- scientific article; zbMATH DE number 2168836 (Why is no real title available?)
- The complexity of the generalised cyclic Towers of Hanoi problem
- On uniqueness of solution to the multi-peg towers of hanoi
- Generalized sequencing problem “Towers of Hanoi”
- Stockmeyer's tower
- What is the least number of moves needed to solve the \(k\)-peg Tower of Hanoi problem?
- A note on the Frame-Stewart conjecture on the generalized Tower of Hanoi problem
- The generalized four-peg tower of hanoi problem
This page was built for publication: The generalizedppeg tower of hanoi problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764584)