Scaling an iterative, bitwise algorithm to solve the Towers of Hanoi using X discs and Y towers
- by Robb
I like the algorithm mentioned in this question: "How does this work? Weird Towers of Hanoi Solution"
http://stackoverflow.com/questions/2209860/how-does-this-work-weird-towers-of-hanoi-solution
Is there any way to scale that non-recursive solution of Towers of Hanoi to use X disks and Y towers, with towers represented as stacks?