The generalized four-peg tower of hanoi problem
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- An iterative algorithm for the Tower of Hanoi with four pegs
- The fourth tower of Hanoi
- A new lower bound for the Towers of Hanoi problem
- Generalized sequencing problem “Towers of Hanoi”
- The complexity of an optimal algorithm for the generalized tower of hanoi problem
- Exact closed form algorithm for the four peg Tower of Hanoi puzzle
- Further development in multi-peg tower of Hanoi algorithms
- Solution for the tower of Hanoi problem with four pegs
- Towers of hanoi problem with arbitraryk≧3 pages
- scientific article; zbMATH DE number 978252 (Why is no real title available?)
- scientific article; zbMATH DE number 2168836 (Why is no real title available?)
- The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
- The generalizedppeg tower of hanoi problem
- The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem
- scientific article; zbMATH DE number 1439478 (Why is no real title available?)
- Stockmeyer's tower
- Generalized multi-peg tower of hanoi problem
- LIFTING PUZZLES IN DEGREE FOUR
- Comparison of two generalized methods for solving multi-peg towers of Hanoi puzzles
This page was built for publication: The generalized four-peg tower of hanoi problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835615)
