![]() The only difference is, we have an arrow at a certain place. So, we see zero one, zero two, one two, zero one, zero two, one two, zero one, zero two, one two. Then, we're going to move anything in spot zero to spot two, and then from spot one to spot two. The first thing we're going to do is we're always going to move something in spot zero to spot one. But at this point, we can start to see that we're seeing a pattern of moves. Then, we can go ahead and move the yellow cube over with the idea that we want to move the purple cube out of the way. ![]() This is our final position for that blue cube, so we're in good shape. Only now can we move the big cube from the first position all the way over to the position in stack two. The first thing that needs to be done is the yellow cube needs to move to stack zero, then the purple cube can move to stack one, and then the yellow cube can move on top of stack one from stack zero. The orange cube could move from stack zero to stack one, and we begin moving everything else on top of the orange cube. After I've moved the small subset over to stack two, I started working on next cube, the orange cube. The final thing I did was move the yellow cube from stack one to stack two, I'm going to denote this as one to two. The next thing I did was I moved the purple cube that was here to stack two, this is the move zero to two. ![]() I'm going to note the move here as zero move to one. The first move I made, moved the yellow cube on top, down to the beginning of stack of one. When I introduce a problem I randomly move cubes around with the goal being trying to move cubes to the right as much as possible. Let's look at one solution to the Tower of Hanoi problem.
0 Comments
Leave a Reply. |