Easy Solution to the Tower of Hanoi, Hack Hanoi

Easy way to solve the puzzle Tower of Hanoi, Recursive sequence, programming algorithm. Easy solution and why it works.

[duanedonaldson]

With 3 discs, the idea is to move the discs to the last peg, not just any peg. We start at the source peg, the center is the aux peg and the last peg is the destination peg. In your case, you can call this a rule or a goal. Programming algorithms are more strict than what you have mentioned in the video. I like your ODD and EVEN number of peg moves, that algo can be reversed to arrive at my first statement. If you want to show a circle-type move, you can make a game board with the pegs in a triangle shape. Thanks so much.

[PokeShadow]

This video is surprisingly relaxing to listen

[NorrisAviation]

On number five for the smallest plate why did you only go one

[BlaZePlayZeYT]

Can we transfer A to B, u did that right sir, but when I saw the rule in Google, they showed we have to transfer from A to C, the one u did is A to B, is that also right sir???? Ur explanation is soo good and easy thx for the tutorial

[dariuscarter]

do you automatically use the odd and even rule or trick on the largest number of discs in that row?

[DaleC]

I am confused by the terminology here. Shouldn’t it be a minimum number of “moves” not “ways”?

[adamhughes]

The objective is to get them to the other side not the middle…

[kyletree]

Don't get how this has anything to do with math instead of saying you CAN use math like many other things to solve it