We can use B as a helper to finish this job.
How do we do this?īefore we can get there, let’s imagine there is an intermediate point B. Our job is to move this stack from source A to destination C. In other words, a disk can only be moved if it is the uppermost disk on a stack.
Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack.Well, this is a fun puzzle game where the objective is to move an entire stack of disks from the source position to another position. Before getting started, let’s talk about what the Tower of Hanoi problem is.
