ASMR? Tower of Hanoi puzzle solved - 1 to 9 discs - scraping, rattles, clicks

Tower of Hanoi purchase links
8 discs (coloured) - amzn.to/3aW7qww
9 discs (plane) - amzn.to/3d17Ino
10 discs (coloured) - amzn.to/2KQPtVF
----------------------------------------
My website showing every puzzle I have ever made ► tonyfisherpuzzles.net
----------------------------------------
RECOMMENDED PLACE TO BUY PUZZLES
HKNowStore ► shrsl.com/p5rk (Free worldwide shipping, good customer service, PayPal- all currencies accepted).
----------------------------------------
As an affiliate with HKNowstore, Lightake, Puzzlemaster & Amazon I earn from purchases made through my links.

[@TonyFisherPuzzles]

There are many variations of this puzzle / game. Use links in description for purchase details.

[@canalcubovicio]

Hi Tony ! There is a puzzle called Rudenko's Disk. This puzzle is a variation of the hanoi tower. The same puzzle but as a disk. If you wish, you can watch a solve on my channel :) .

I was introduced to this logical game in an I.T class at high school and it is truely lovely yet braintwisted. So glad you've brought it into "touchable" puzzle ♡. Also, your cube-based puzzles are very nice. Greets from Vietnam

[@nathanaelsmith3553]

That's how I move things around in my tiny kitchen when cooking

[@PawDieFur]

Somthing I love about these puzzles is the reasons. When I taught people how to do these, I always explained "the third piece always follows the first".

[@hunterdeardurff4386]

I really like it. I want it. this makes me want to start a whole puzzle collection.

[@ppuzzles]

It took me an hour to solve 9discs of Hanoi Puzzles

[@RPKGameVids]

The sounds are quite satisfying.

[@MrRealgamer777]

TOH has a time complexity of O(2^n) so if you continued with a larger number of rings, the number of moves would continue to exponentially increase. 2^9 = 512, 2^10 = 1024, 2^11 = 2048, 2^12 = 4096

[@penfold7800]

Thanks for sharing. This and the ancient Chinese slide puzzle are my two favourite puzzles. Two simple rules, if there's an odd number of discs, the first move is to put the first smallest disc on the farthest post. If there's an even number of discs, the first move is to put the first disc on the middle post. Once the strategy for moving 3 discs is learnt, the rest is just logical repetition. 'HouseOfMarbles' makes a handy pocket version of this puzzle.

[@peacehead1]

Awesome...🥰😍😍 Thanks you very much!!! ❤️

[@hamkahasnim670]

Nice

[@nabranestwistypuzzler7019]

Cool

[@rosebuster]

Towers of Hanoi is a puzzle that's very interesting in theory and quite famous especially among those that study computer science, but actually solving it in reality for large number of disks is quite a pain!

[@catrielmartinez4538]

true satisfaction

[@tonyr.4950]

for some reason Smash Mouth's "Walkin on the Sun" started playing in my head during the 24:50 zoom in. and it fits.

[@nxn8148]

Very good! My best for 5 is 26 moves.

[@nabranestwistypuzzler7019]

I realized a pattern, which is that the minimum amount of moves is (2^n)-1 where n is the number of discs.

[@penfold7800]

Maybe it was the first instance of binary logic. ...the 'rice on a chessboard' myth uses the same equation. 1 grain on the first square, 2 grains on the second, 4 grains on the next and so on, all the way up to 64 squares. How many grains of rice would there be in total on the chessboard'? (Strangely, nobody seems to have asked how big the chessboard would have to be.)

[@reeeech9245]

It’s a child’s toy, but I couldn’t appreciate this until I was older. Meaning as a child and no one to enforce the rules it’s easy to cheat and doesn’t make sense unless you play by the rules.

[@fanheroteam6504]

Is that Hanoi in Vietnam?

[@leslie7922]

plane or plain :P

[@21lhy]

Wow this hard

[@6infinity8]

Actually the structure of this game is fairly simple