How to play Tower of Hanoi

Learn the rules to the puzzle game Tower of Hanoi quickly and concisely - This video has no distractions, just the rules.
Don't own the game? Buy it here:
buy.triplesgames.com/TowerOfH...
(As an Puzzle Master affiliate, I earn from qualifying purchases)
RULES:
The object of the single player puzzle game is to move the tower from one post to another post. Layout the board with the tower on any single post with the largest disc on the bottom and descending in size so the smallest is on top. You may only move 1 disc at a time to any of the 3 posts as many times as you like. You may not move a bigger disc on top of a smaller disc. Move the entire tower from one post to another to win!

[@Dreadmonkey1]

The thing with this puzzle is that after you've learned how to solve the puzzle, it's no longer a puzzle but a chore

[@justagamer878]

Solve It in 3 minutes or less, or no dinner for you, Young Man!

[@hamizannaruto]

That's a lot of puzzle, many don't have replayability, the one that do, you are solving into a method, rather than, solving like a puzzle..

[@doomse150]

But isn't that true for every puzzle? Once you remember the solution, reproducing it becomes easy (and by extension boring) unless you have an additional objective, like going fast, to keep it interesting.

[@Thesnakerox]

Honestly for puzzles like this, once I know how to solve it, solving it again becomes very zen for me. It's a similar effect to that of a 6x6 or 7x7 Rubik's Cube, where I can just kinda shut my brain off and relax while I solve it.

[@Kazmahu]

@@doomse150 Yes, but the Tower of Hanoi is interesting in that it's an example of a recursive solution. Once you know the proper steps, the number of disks doesn't matter. It's the same process, it just takes longer because you have to repeat it more times.

[@LarryBordo]

This is a classic puzzle in computer science, as the solution and number of steps is a great introduction to recurrence. The tower of Hanoi features in the first chapter of the textbook Concrete Mathematics, and one of the exercises includes determining how many steps it would take for a four-post Tower of Hanoi

[@mohamedazadabdulrahman3226]

Also, there is an official number based on the Tower of Hanoi; the minimum of moves required to complete the tower of Hanoi.

[@casperrabbit7254]

I remember these from the Professor Layton games, definitely a pain in the arse to complete 🤣

[@crep50]

See once you learn that you can just count in binary to solve it (with some specifications) you can solve it for any amount of discs

[@ItsPickaxe]

You brought back the moving camera intro '-'

[@asheep7797]

How long does this take?
P = number of pieces
2^P - 1 steps. (optimal)

[@habibiaz7518]

im very late but can you explain to me why is it 2^p-1, i understand a little bit why is it -1 because the number of step the biggest disk is always 1, but what about the 2^p part?

[@whosasking9655]

@@habibiaz7518P is number of pieces. The formulae is basically, 2 (raised to the power of/exponential) P minus 1. In mathematics and computer science, the ^ symbol is used to represent the “power” of.
So a typical game with 7 pieces should be optimally solved in (2^7)-1. Which is 127 moves.
I over explained the formulae, I hope it’s clear.

[@arieelberian7614]

Having the stack start from the middle is weird to me, since I always do it from the left to right.
Still a really nice game.

[@puffwerdolvp5101]

ok now i know the basics i might actually forget them when i actually do it

[@hansob_yt]

I remember we made a code that needed your numbers of the disks and the code would generate a way to do the puzzle 👍

[@flameknightkiana]

Hanoi is the capital city of Vietnam

[@rafa57games]

Hey. I created a game that uses a uno regular deck to play and it's pretty cool (I've being playing it a lot with my family).
If I teach you the rules, and you like it, would you consider creating a video teaching it?
It would be a dream come true to know that more people are having fun in a game I created

[@bryan9587]

Nah

[@Kromiball]

Dude just give the rules

[@rizzwan-42069]

Pls write it down

[@x_techno_pro]

The object of this game is to make programmers cry when learning dynamic programming

[@austinkoontz2845]

Cool.

[@hoangle-sz4hl]

Capital in Vietnam is Hanoi

[@nguyennhoangnam28]

Hanoi is my country's capital city

[@minhnguyentat4119]

Me 2

[@JiecinDumolang2011]

I found this in the school, it soo big...than a pole is 4ft!

[@PaGDu333]

Goodest ebglish you got dare

[@adrianwoodruff1885]

So that's the name of the puzzle.

[@Luisinvietnam]

As a Vietnamese, the “Hanoi” word was a capital in Vietnam

[@trplngzz]

me playing tower of hanoi idk what do just stack them to other side but im only mastered the six instead of seven insta regret

[@hkayakh]

I think I’ve solved one of these with 8 or 10 discs

[@AgentH53]

Tower of Hanoi?
That is like trying to organize the Switch games you have between two SD cards.

[@user-yn8nc5wo7m]

I finished 13 disks.

[@Player-df7ny]

Feels just like 1 single chess puzzle.

[@AlexLitaOfficial]

You should have played it in Hanoi.

[@PaGDu333]

Not first but definetly early (I got grounded)

[@wootier]

aye vietnamse puzzle game?

[@HydroMercury]

Game: The Death (English name)

[@HNBGamer]

Originate during French occupation

[@namdaibf]

Hanoi is in Vietnam(my country)

[@Kevinelitegaming00]

Hello

[@dinhducnam308]

Hanoi = Hà nội

[@TheVietAVGuy]

First

[@pablitopasquali693]

This is not "how to play" but reading the instructions out. I was expecting a systematic explanation of how to beat it.

[@Fyrefly26710]

The least amount of move that you can play in a single round is:
2^p-1 ; p=quantity of the pieces that you play

[@Fyrefly26710]

Fun fact:if you play with 64 pieces,it would take you 585 billion years for you to complete the round if you a pieces one second at a time