The recurring rules is = odd number of discs: starting point is always the final destination position. Even number of discs: starting point is the tempoary pole. You use this rule with every single iteration and breakdown of each entire movement.
"How to solve the Towers of Hanoi" LPC: Makes an in-depth explanation on how to transfer each disc to the other side of the board. Me, an intellectual: Grabs the entire stack and moves it onto the right hand side. Easy!🤣
I mean, the video is helpful but there's a fine line between thorough and tedious and you cross it around the 3:00 mark. You really make the viewer do most of the work this way. The most helpful point - whether to begin moving an interim right to the right or the left depending on whether it's composed of an odd or even number of rings, is mentioned only in passing.
Works and I got it in 31 moves (which is the theoretical minimum from (2^n) -1 where n is number of discs. If it's even you do 1-2-3, If it's odd you do 3-2-1 (still going from 1, 2, 3, just showing direction to end up on the 3rd pillar).
To clarify the technique Move smallest piece in a 1-2-3 pattern. After moving the smallest piece, move the next legal move, of which there will only be one. Then resume the smallest piece along it's 1-2-3 path. Repeat. If the number of discs is even, do 1-2-3, if it is odd do 3-2-1. Alt, even, move to the right; odd, move to the left.
I have this on an app and absolutely despise this game, but only because I can’t figure it out. I’m on a level with 7 rings and have been trying forever.
I’m sorry. I didn’t know how I ended up here and honestly I don’t get why this should be discussed by anyone. In addition to the uninteresting nature of the problem, the way the video is presented makes me sleepy. So disengaging. Sorry , but I had to share this. I cannot recover the minutes I spent here.
They’re not “slow”, they’re detailed and thorough. There’s a difference. Sorry your attention span isn’t long enough and your desire to understand insufficient.
What a boring presentation. Mate, just follow this recursive algorithm; function solveHanoi(n, source, destination, auxiliary): if n == 1: print("Move disk 1 from", source, "to", destination) return solveHanoi(n-1, source, auxiliary, destination) print("Move disk", n, "from", source, "to", destination) solveHanoi(n-1, auxiliary, destination, source) By the way, for N disks, there will be 2^N - 1 moves.
![[LIVE] : ONE ลุมพินี 88 | คู่เอก "ป้อมเพชร vs อัสลามจอน"](http://i.ytimg.com/vi/1ZqTVVbMgbo/mqdefault.jpg)
The recurring rules is = odd number of discs: starting point is always the final destination position. Even number of discs: starting point is the tempoary pole. You use this rule with every single iteration and breakdown of each entire movement.
i can say you are a programmer from this comment alone
Just discovered your channel through this video. I'm a big fan already and I plan to binge-watch the rest of your videos. Subscribed!
Excelent video. Clear, concise and superbly demonstrated. Now I'm off to write my own algorithm to solve it, wish me luck lol
Best of luck! :-) 🤞
Concise? 🤣🥴
Wonderfully Explained, Thank You!!
Before i watch this video, i have the same technique with you. 😊
"How to solve the Towers of Hanoi"
LPC: Makes an in-depth explanation on how to transfer each disc to the other side of the board.
Me, an intellectual: Grabs the entire stack and moves it onto the right hand side. Easy!🤣
Skip to 8:30
I mean, the video is helpful but there's a fine line between thorough and tedious and you cross it around the 3:00 mark. You really make the viewer do most of the work this way. The most helpful point - whether to begin moving an interim right to the right or the left depending on whether it's composed of an odd or even number of rings, is mentioned only in passing.
Thanks for the feedback!
Move the smallest disc in a 1-2-3 pattern left to right, then make the next legal move (only one will remain) then boom. Solved!
Hmmm... I'm not convinced this always works... For example, if you have an odd number of discs I don't think it works...
@@LockPickingCuber I have a tower of Hanoi app, I'll try it on 5 dics to start.
Works and I got it in 31 moves (which is the theoretical minimum from (2^n) -1 where n is number of discs.
If it's even you do 1-2-3, If it's odd you do 3-2-1 (still going from 1, 2, 3, just showing direction to end up on the 3rd pillar).
To clarify the technique
Move smallest piece in a 1-2-3 pattern. After moving the smallest piece, move the next legal move, of which there will only be one. Then resume the smallest piece along it's 1-2-3 path. Repeat.
If the number of discs is even, do 1-2-3, if it is odd do 3-2-1. Alt, even, move to the right; odd, move to the left.
Ah, yes. That might work. I guess an additional constraint is just not to back track.
I have this on an app and absolutely despise this game, but only because I can’t figure it out. I’m on a level with 7 rings and have been trying forever.
Holy shit there is no reason this video needs to be 13 mins long.
Cool.
Even on x2 speed it’s like slow motion 😊
Before that get to the point! Damn
Solved it in 1 move by rotating the puzzle 180° 😂
Genius!
Not legal
I’m sorry. I didn’t know how I ended up here and honestly I don’t get why this should be discussed by anyone.
In addition to the uninteresting nature of the problem, the way the video is presented makes me sleepy.
So disengaging.
Sorry , but I had to share this. I cannot recover the minutes I spent here.
I think it's safe to say this video was not for you. Sorry you didn't enjoy it! :-)
Mate, your videos are so flippin slow! I couldn’t watch it til the end, I’ve gone to find the fast solution.
Fair enough. Sorry you didn't find it helpful!
I'm waiting for your day videos. This man explains the concept instead of solving it "fast" for you. So yes a show and thorough explanation is needed.
They’re not “slow”, they’re detailed and thorough. There’s a difference.
Sorry your attention span isn’t long enough and your desire to understand insufficient.
Need to get to that 10 minute mark to monetize!😂
What a boring presentation. Mate, just follow this recursive algorithm;
function solveHanoi(n, source, destination, auxiliary):
if n == 1:
print("Move disk 1 from", source, "to", destination)
return
solveHanoi(n-1, source, auxiliary, destination)
print("Move disk", n, "from", source, "to", destination)
solveHanoi(n-1, auxiliary, destination, source)
By the way, for N disks, there will be 2^N - 1 moves.