Introduction
Our course work is called the towers of Hanoi. We were asked to have x number of discs and move them to a different place in the least number of moves possible. There are two other places you can move them to. This is what it looks like with 4 discs.
You have to move all of the discs to either B or C, they have to be in the same order. While moving the discs you can not put a bigger disc on top of a smaller one.
Our course work is called the towers of Hanoi. We were asked to have x number of discs and move them to a different place in the least number of moves possible. There are two other places you can move them to. This is what it looks like with 4 discs.
You have to move all of the discs to either B or C, they have to be in the same order. While moving the discs you can not put a bigger disc on top of a smaller one.