Hardest Riddle Ever, First person who solves is awesome?!


Question: Hardest Riddle Ever, First person who solves is awesome!?
If you have ten disks stacked from biggest to smallest on one post, how do you move the disks to a third post so that the order is the same in the end!? Larger disks cannot go on top of smaller ones, and you can only move one at a time!. No, it's not a trick, you cannot take all of them off and then put them on the third post!.Www@Enter-QA@Com


Answers:
Repeat this pattern
put the small one on post 3 then move the a little bigger one on post 2 then move the small one to post 1 then the a little bigger one to post 3 the small one to post three on top of the little bigger one!. Then put the next larger one on post 2 since its empty then move the small one to post 2 and move the a little bigger one to the first post then move the small one to post 1 and move the bigger one over keep on doing the pattern!. Read this guide Problem 1: Move one disk from the top of pile A to pile B!.
Solution 1: Do it!

Problem 2: Move a stack of the two smallest disks from the
top of pile A pile to pile B!.
Solution 2: Move the small disk to the pile C!. Move the large one
to pile B!. Move the small one to pile B!.

Problem 3: Move a stack of the three smallest disks from the
top of pile A to pile B!.
Solution 3: Use Solution 2 (relabeling the piles B <-> C) to
move the two smallest disks to pile C!. Move the
largest one to pile B!. Use Solution 2 (relabeling the
piles A <-> C) to move the two smallest ones to pile B!.

Problem 4: Move a stack of the four smallest disks from the
top of pile A to pile B!.
Solution 4: Use Solution 3 (relabeling the piles B <-> C) to
move the three smallest disks to pile C!. Move the
largest one to pile B!. Use Solution 3 (relabeling the
piles A <-> C) to move the three smallest ones to pile B!.

Problem 5: !.!.!.
Solution 5: !.!.!.

!.!.!.

Problem n: Move a stack of the n smallest disks from the top
of pile A to pile B!.
Solution n: Use Solution (n-1) (relabeling the piles B <-> C) to
move the n-1 smallest disks to pile C!. Move the
largest one to pile B!. Use Solution (n-1) (relabeling the
piles A <-> C) to move the n-1 smallest ones to pile B!.

The trick is in keeping track of the relabeling during the process!

Example: Move 4 disks from X to Y:
X Y Z
Start: 1234 - -
1!. Move 1 from X to Z: 234 - 1
2!. Move 2 from X to Y: 34 2 1
3!. Move 1 from Z to Y: 34 12 -
4!. Move 3 from X to Z: 4 12 3
5!. Move 1 from Y to X: 14 2 3
6!. Move 2 from Y to Z: 14 - 23
7!. Move 1 from X to Z: 4 - 123
8!. Move 4 from X to Y: - 4 123
9!. Move 1 from Z to Y: - 14 23
10!. Move 2 from Z to X: 2 14 3
11!. Move 1 from Y to X: 12 4 3
12!. Move 3 from Z to Y: 12 34 -
13!. Move 1 from X to Z: 2 34 1
14!. Move 2 from X to Y: - 234 1
15!. Move 1 from Z to Y: - 1234 -

Notice the pattern of the disk being moved:

1,2,1,3,1,2,1,4,1,2,1,3,1,2,1!.

On all odd numbered moves, you are moving disk 1!. If the move number
is 2 times an odd number, you are moving disk 2!. If the move number
is 4 times an odd number, you are moving disk 3!. In general, if the
move number is 2^n times an odd number, you are moving disk n+1!.

Notice Steps 1-3 are Solution 2 with A = X, B = Y, C = Z!.
Notice Steps 5-7 are also Solution 2 with A = Y, B = Z, C = X!.
Notice Steps 9-11 are also Solution 2 with A = Z, B = X, C = Y!.
Notice Steps 13-15 are also Solution 2 with A = X, B = Y, C = Z!.

Notice Steps 1-7 are Solution 3 with A = X, B = Z, C = Y!.
Notice Steps 9-15 are also Solution 3 with A = Z, B = Y, C = X!.

You can plan the whole operation ahead!. There will by 2^d-1 moves if
there are d disks!. Move 2^(d-1) will be to move the largest disk from
X to Y!. To do that, you must move the d-1 smaller disks off of X, but
not put them at Y, but at Z!. That will take Steps 1 through 2^(d-1)-1!.
Afterwards, you have to move the d-1 smaller disks from Z to Y!. That
will take Steps 2^(d-1)+1 to 2^d-1!. That divides the problem into two
smaller ones of the same kind!. Now you plan each of those in a similar
way: the middle step will be moving the largest disk from its starting
place to the appropriate destination!. The preceding steps will be to
get the smaller disks out of the way, and the following steps will be
to move the smaller disks to the destination!.

Sorry if its longWww@Enter-QA@Com

i know the answer!.!.!.its quite simple if you understand it!. the person who explained it the longest one, i forgot the name, got it right!. it is simply a math question!. just follow slowly what he said unless you want to follow this short one!.!.!.(i'm giving them numbers ok!? 10 is smallest and 1 is biggest)



-put 10 disk on the 3rd post
-put 9 disk on the 2nd post
-put 10 disk on top of the 9, it works fine
-put 8 on the 3rd post
-put 10 on the 1st post
-put 9 on 8
repeat this pattern until you have the answer!. remember, you should switch off post 2 and 3 Www@Enter-QA@Com

sorry but its hard to explain in words!. i think i know what you referring to!. its the riddle where there are the 3 yellow post things with the red rings!. it took me 1 hour 10 minutes to complete ( i have know life =) )!. Its a long annoying process but im sure you'll get it =)!. best of luck!!!!! Www@Enter-QA@Com

i think you stack them from smallest to biggest on the second post and then stack them back to biggest to smallest on the third post!.

I've heard of this one before but it only involved 3 discs!.Www@Enter-QA@Com

its not that hard just remember that an even number can't go on top of an even and odd can't go on odd!. (number the disks first)!.Www@Enter-QA@Com

well if there a three posts then you take one at a time and put them on the 2nd stack and then copy to the 3rd stack and the order will be correctWww@Enter-QA@Com

u stack them on the second post smallest to biggest and then go to the third post biggest to smallest againWww@Enter-QA@Com

Your riddle is seriously flawed!. There are many logical answers!.Www@Enter-QA@Com

!? lay them all out on the ground, then stack them on the third post in order one at a time!.
idk!.Www@Enter-QA@Com

I dont understand the riddle!. Www@Enter-QA@Com

Ooo! Tower of Hanoi riddle
Www@Enter-QA@Com

Isn't that a game somewhere, I remember playing that!. It was like Tower of something!.!.Www@Enter-QA@Com

!.!.!.Www@Enter-QA@Com

get a disk from the last post and 1 from the first post!.Www@Enter-QA@Com

!?Www@Enter-QA@Com

Push the discs down and re stack them!?
Seems like logic to me!.
:)Www@Enter-QA@Com

!.!.!. i don't know but i think it's like the hardest riddle EVERWww@Enter-QA@Com



The answer content post by the user, if contains the copyright content please contact us, we will immediately remove it.
Copyright © 2007 enter-qa.com -   Contact us

Entertainment Categories