Tower of Hanoi puzzle
0
the tower of hanoi puzzle... you move the entire tower from one place to another...
theres a complex math problem beyond this puzzle....
how fast can you do it? only rule is that big piece cannot sit over the smaller piece while moving the discs....
you can lessen the discs of you wish.... but it cannot go lower than three discs....
0
Ah you made me recall the Recursion lecture in highschool programming class.
Anyway, number of moves = 2^discs - 1
And I like the myth about the monks solving the same using 64 golden discs, and on completion the world will end. 2012 much?
Spoiler:
Anyway, number of moves = 2^discs - 1
And I like the myth about the monks solving the same using 64 golden discs, and on completion the world will end. 2012 much?
0
gurumao wrote...
Ah you made me recall the Recursion lecture in highschool programming class.Spoiler:
Anyway, number of moves = 2^discs - 1
And I like the myth about the monks solving the same using 64 golden discs, and on completion the world will end. 2012 much?
you guys are using else-if and cout? well i think there was another library to solve this puzzle.... i think math lib will be just fine in this....
also you are right about the myth.... 64 golden disks, immortal priests/monks continuously moving them... and if last move is complete... world ends....
0
I think you had to do something like this in mass effect 1. That puzzle was fucking annoying because I didn't know the rules.
0
luinthoron
High Priest of Loli
Rbz wrote...
I think you had to do something like this in mass effect 1. That puzzle was fucking annoying because I didn't know the rules.And in KotOR before that. BioWare loves this puzzle. :D
0
Rbz wrote...
I think you had to do something like this in mass effect 1. That puzzle was fucking annoying because I didn't know the rules.only rule here was big piece cant sit over the little piece....
0
I hate these kinds of puzzles. They don't force you to actually think at all and can just be solved via trial and error if you don't want to think about them and thus just end up being time wasters.
0
I know how to do this mathematically, but it's hard to explain... but i'll try to.
First count from top to bottom. In this case, there's 8.
If there is an even number of Hanoi blocks, put the 1st one in the middle for the first move. Then 2nd one right. 1st one on the 2nd. 3rd one in the middle, 1st one left. 2nd one middle. 1st one middle. 4th one right. 1st one right. 2nd one left. 1st one left. 3rd one right. 1st one middle. 2nd one right. 1st one right. 5th one middle. 1st one left. 2nd one middle. 1st one middle. 3rd one left. 1st one right. 2nd one left. 1st one left. 4th one middle. 1st one middle. 2nd one right. 1st one right. 3rd one middle. 1st one left. 2nd one middle. 1st one middle........ and so on.
If there is an odd number of Hanoi blocks, put the 1st one in the right for the first move. and do kind of the similar way as the method at the top... I DO NOT know how to explain this.. jesus....
First count from top to bottom. In this case, there's 8.
If there is an even number of Hanoi blocks, put the 1st one in the middle for the first move. Then 2nd one right. 1st one on the 2nd. 3rd one in the middle, 1st one left. 2nd one middle. 1st one middle. 4th one right. 1st one right. 2nd one left. 1st one left. 3rd one right. 1st one middle. 2nd one right. 1st one right. 5th one middle. 1st one left. 2nd one middle. 1st one middle. 3rd one left. 1st one right. 2nd one left. 1st one left. 4th one middle. 1st one middle. 2nd one right. 1st one right. 3rd one middle. 1st one left. 2nd one middle. 1st one middle........ and so on.
If there is an odd number of Hanoi blocks, put the 1st one in the right for the first move. and do kind of the similar way as the method at the top... I DO NOT know how to explain this.. jesus....
