After playing this game again and again and watching the solution i found out the pattern: (Always remember you will be moving the first disk (smallest disk) on every second move. This means every odd number of move will be made by the smallest disk(for eg: 1st move, 3rd move, 5th move)) So this trick is different for odd number of disk and even number of disk First check if the number of disk is even or odd: For odd number of disk (for eg 3 disk, 5 disk, 7 disk etc): • 1: move the smallest disk (which will be on the top) to the last pole. Move the other ring to the remaining empty pole. • 2: then again move the smallest disk to middle pole. • 3: make a move with any other disk . (Always remember once you move the smallest disk you will only have one legal move with any other disk since you can't place the bigger disk on smaller disk and you can't move the smallest disk on this turn. This rule/logic applies to every turn after moving the smallest disk.) • 4: now move the smallest disk to first pole. • 5: make a move with any other disk to any pole. • 6: repeat from • 1 to • 5 untill you are done. This will solve the problem in the minimum move possible and the number of minimum move for any number of disk is going to be (2^n) - 1. For eg: minimum number of move for 5 disk is going to be 2⁵ - 1 = 31 For even number of disk (for eg: 4 disk, 6 disk, 8 disk etc ) All the steps are going to be the same as above with just a simple change. In above sequence we were moving the smallest disk From first pole to last pole Then from last pole to middle pole Then from middle pole to first pole. We were doing this on every second move. For even number of Disk the sequence for moving the smallest disk on every second turn will be: From first pole to middle pole From middle pole to last pole From last pole to first pole All this might seem difficult and confusing but with practice you will be able to do it. If at any point you got stuck or took more than minimum number of moves then it means you made a mistake while moving the smallest disk (so restart) never quit before reaching the minimum number of moves Additional information: If you use the even number of disk trick in odd number of disk you will end up filling the middle pole instead of last pole. Do it if that's your goal. Same for odd number of disk. If you use the even number of disk trick here you will end up filling the middle pole in minimum number of moves.
the way i do it is like this. i find where the last piece needs to end therefore the second last piece needs to be in the other place and keep alternating till you arrive at first piece. rinse and repeat and that's it.
Came here after the Pagoda Stack puzzle in Genshin Lmao, didn't expect such thing in-game, though it sometimes happens that they show us some irl things in-game, this was unexpected.
🚨🚨🚨🚨🚨🚨🚨🚨🚨🚨🚨 An easier method I found out for myself is to use the left right method. If all my rings are in column A, then column B would be left, and Column C would be Right. If I want all my rings to go to the 'right' column but dont know which column to start in, I name each ring top to bottom using Right left. Start at right, then next ring will be left, then next ring will be right, etc. The last ring you stop on will start your first move at the right or left Column. 5 rings Right Left Right Left Right
Solution in text: A -> C A -> B C -> B A -> C B -> A B -> C A -> C A -> B C -> B C -> A B -> A C -> B A -> C A -> B C -> B A -> C B -> A B -> C A -> C B -> A C -> B C -> A B -> A B -> C A -> C A -> B C -> B A -> C B -> A B -> C A -> C
you can express the number of moves required as a function of the number of disks. the recurrence relation solving this function is going to give 2^n -1 moves for n disks. in this case with 5 disks, n=5. so we have 2^5 -1 = 32-1 which gives 31 moves
Solve the following puzzle for Tower of Hanoi · If puzzle can be accomplished in 3 moves with two discs. Use this to work out how many moves would be needed with three discs? · If puzzle can be completed in 15 moves with four discs. Use this to work out how many moves would be needed with five discs? · In general, describe a way of working out how many moves are needed when one extra disc is added? ye kese hoga
hanoi(n)=2×hanoi(n-1)+1, where the function hanoi is how many steps it takes to solvo a puzzle with n rings. DEMONSTRATION: You can move n-1 rings to the middle stick, move the last ring to the last stick, then move n-1 rings to the last stick, on top of the last ring.
Yes , but too many moves. Put the second one from the bottom on the middle post, and accomplish it in 16 moves, let's see if you have that intelligence
![[102] How to solve the Towers of Hanoi](http://i.ytimg.com/vi/LgxihOe9ObI/mqdefault.jpg)
After playing this game again and again and watching the solution i found out the pattern:
(Always remember you will be moving the first disk (smallest disk) on every second move. This means every odd number of move will be made by the smallest disk(for eg: 1st move, 3rd move, 5th move))
So this trick is different for odd number of disk and even number of disk
First check if the number of disk is even or odd:
For odd number of disk (for eg 3 disk, 5 disk, 7 disk etc):
• 1: move the smallest disk (which will be on the top) to the last pole. Move the other ring to the remaining empty pole.
• 2: then again move the smallest disk to middle pole.
• 3: make a move with any other disk .
(Always remember once you move the smallest disk you will only have one legal move with any other disk since you can't place the bigger disk on smaller disk and you can't move the smallest disk on this turn. This rule/logic applies to every turn after moving the smallest disk.)
• 4: now move the smallest disk to first pole.
• 5: make a move with any other disk to any pole.
• 6: repeat from • 1 to • 5 untill you are done.
This will solve the problem in the minimum move possible and the number of minimum move for any number of disk is going to be (2^n) - 1. For eg: minimum number of move for 5 disk is going to be 2⁵ - 1 = 31
For even number of disk (for eg: 4 disk, 6 disk, 8 disk etc )
All the steps are going to be the same as above with just a simple change.
In above sequence we were moving the smallest disk
From first pole to last pole
Then from last pole to middle pole
Then from middle pole to first pole.
We were doing this on every second move.
For even number of Disk the sequence for moving the smallest disk on every second turn will be:
From first pole to middle pole
From middle pole to last pole
From last pole to first pole
All this might seem difficult and confusing but with practice you will be able to do it. If at any point you got stuck or took more than minimum number of moves then it means you made a mistake while moving the smallest disk (so restart)
never quit before reaching the minimum number of moves
Additional information:
If you use the even number of disk trick in odd number of disk you will end up filling the middle pole instead of last pole. Do it if that's your goal. Same for odd number of disk. If you use the even number of disk trick here you will end up filling the middle pole in minimum number of moves.
the way i do it is like this. i find where the last piece needs to end therefore the second last piece needs to be in the other place and keep alternating till you arrive at first piece. rinse and repeat and that's it.
Came here after the Pagoda Stack puzzle in Genshin Lmao, didn't expect such thing in-game, though it sometimes happens that they show us some irl things in-game, this was unexpected.
First time I tried it I got it in 37 moves. Just did it again and got 34 moves!
perfect is 30
@@Koolpro47 perfect is 31
🚨🚨🚨🚨🚨🚨🚨🚨🚨🚨🚨
An easier method I found out for myself is to use the left right method. If all my rings are in column A, then column B would be left, and Column C would be Right. If I want all my rings to go to the 'right' column but dont know which column to start in, I name each ring top to bottom using Right left. Start at right, then next ring will be left, then next ring will be right, etc. The last ring you stop on will start your first move at the right or left Column.
5 rings
Right
Left
Right
Left
Right
That's awesome
Why not move the whole tower lol
lol
You can't
That's cheating
That how to play this game
We've got a hacker here
Just here for our math project
fiona G23 just u then
Me to😂🖐
Hey it's my homework to given my teacher 😎😎
It's my today's homework
Today mine h.w
And today mine 😂
@@aryangaur228 And today mine assignment i have to program it in c++ 😂
Solution in text:
A -> C
A -> B
C -> B
A -> C
B -> A
B -> C
A -> C
A -> B
C -> B
C -> A
B -> A
C -> B
A -> C
A -> B
C -> B
A -> C
B -> A
B -> C
A -> C
B -> A
C -> B
C -> A
B -> A
B -> C
A -> C
A -> B
C -> B
A -> C
B -> A
B -> C
A -> C
Can you proceed the solution til 8 desk?😊 plsss badly need
Hello sir, is there a mathematical explanation for the moves?
thank you
you can express the number of moves required as a function of the number of disks. the recurrence relation solving this function is going to give 2^n -1 moves for n disks. in this case with 5 disks, n=5. so we have 2^5 -1 = 32-1 which gives 31 moves
it's just x2 + 1 each sequence
@@aryanshirazi5972 what does ^. means?
@@ga7667 (to the power of)
შენ გენაცვალე ყვერებში შენ გამო ბანაკში მოვიგეთ ❤❤
Damn i miss that old school prompt. :)
What is the name of the game
Cool!
Ty
Hello,Can I us this video for lesson?Pleas
how many steps with 14 disks?
Should be around 16000 moves
you will need at least 2^14 -1 = 16383 moves
@@aryanshirazi5972 why 2^14-1?
well i completed 5 rings in 134 moves :/
less the moves, better your thinking
Whats you understand the principle behind this you can solve any amount
Cool.
Who’s here after Chaz’s live 😂✋🏽
Solve the following puzzle for Tower of Hanoi
· If puzzle can be accomplished in 3 moves with two discs. Use this to work out how many moves would be needed with three discs?
· If puzzle can be completed in 15 moves with four discs. Use this to work out how many moves would be needed with five discs?
· In general, describe a way of working out how many moves are needed when one extra disc is added?
ye kese hoga
hanoi(n)=2×hanoi(n-1)+1, where the function hanoi is how many steps it takes to solvo a puzzle with n rings.
DEMONSTRATION:
You can move n-1 rings to the middle stick, move the last ring to the last stick, then move n-1 rings to the last stick, on top of the last ring.
given n disc, we can find it with 2^n - 1
2^n-1👍. Two power n subtraction one
I did it in 31 moves without watching this video
poundSignMeToo. Although I didn't have actual disks in front of me. But glad to read it can be done in 31, so I probably didn't make a mistake :)
@@steveman1982 nice
I got 31 moves in 15 Seconds
I solved it in thirty moves
How to play this
There's an app on playstore
Is it.
Ya me to 😂😂😂😂😂😂😂
Why not rotate the Board Lol.
The towers are labelled, #1, #2, and #3.
a person who thinks all the time
This music is nostalgic
31 step 😁
Why person make this so fast 😢
اريد حلا بلغة java or c
ok
Bhot hard
like
5 is easy try 9
you will need at least 2^9 -1 = 511 moves
u
Well I can’t remember this. There goes my party trick besides water to wine
Aim bot I called it😂
shut up fortnite idiot
....
i can do it in 4 steps
You are the next Einstein then
hhhhhhhhhhhhhh
@@UrGuru
This is a rule based game ...u can't simply move the whole tower in once...try it with rules ...
dude stop....
Yes , but too many moves. Put the second one from the bottom on the middle post, and accomplish it in 16 moves, let's see if you have that intelligence
like
....
like
....