n Disks and m Pegs "Tower of Hanoi" Example Problem

The purpose of this example, is to point out that when one parameter of a problem is changed, it may not always be entirely obvious how this changes the structure of the original problem. In this case the parameter changed is the number of pegs. The animation below begins with 8 disks placed on the leftmost peg. The goal is to move these eight disks to the peg on the right. The rules are the same as the standard 3 peg problem, except that all four pegs can be used.
What is the relation between 4 peg problems and the standard three peg version? For that matter, what if we allow m pegs to be used. Clearly, there are similarities and there are differences. For most of us, I suspect the relationship is not immediately obvious. If you think about it awhile, the relationship may become apparent. Once found it may then seem obvious.		Solution for an 8 disk and 4 peg "Tower of Hanoi" Problem
The animation above shows the solution to this particular problem and it may help you to discern the general relationship to the the 3 disk problem.

	Problem Solving and Planning
© Charles F. Schmidt