If one were to create a Towers of Hanoi puzzle with four towers instead of three, with rules changed appropriately, it should be possible to create a recursive solution for the puzzle where one of the constraints is that at some point in the solution all of the disks must reside on each of the four towers.

Question

Quizplus · Accepted Answer

The solution to this version of the game can be phrased as follows: Use the 3-peg Towers solution to move all the disks from peg A to peg B; then use the 3-peg Towers solution to move all the disks from peg B to peg C; repeat, moving from peg C to peg D.

If One Were to Create a Towers of Hanoi Puzzle