Tower of Hanoi Tutorial

Показать описание

Tower of Hanoi with three rods and seven disks simple tutorial.

The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

The mission is to move all the disks to some another tower without violating the sequence of arrangement.

A few rules to be followed for Tower of Hanoi are..

1. Only one disk can be moved among the towers at any given time.
2. Only the "top" disk can be removed.
3. No large disk can sit over a small disk.

Thank you for watching..

#towerofhanoi #simpletutorial

Рекомендации по теме

Комментарии

I propose a simple, simple and above all mnemonic solution.
The rule is as follows:
- in one move, move the smallest disk, in a circular way (stakes: a -> b -> c -> b, -> a, etc.),
- in the next one you find yourself having to perform the only possible operation,
- in the next move, move the smallest disk again in a circular way,
- in the next move you find yourself having to perform the only possible operation and so on,
until all the disks have been brought from the stake "a" to the final destination stake "c".
This rule also corrects the first move for odd discs, since the first move of the smallest disk
is repeated from a -> b and from b -> c.
I hope I have been clear, thank you and enjoy.

marcozini

Congratulations you've just mastered recursion.

shubhamraj

This saved my bacon during a tower of Hanoi competition in 5th grade, I didn't know how to do the moves and steps until I saw this video. Truly a life saver

marble

I am watching this video because this is a very famous programming question of the topic 'recursion'. Solve tower of hanoi using recursion and I didn't knew what is tower of hanoi.

pratyushsingh

I came here after faruzan hangout quest v: cant help my curiousity

VDevon

Thank you! I rather watch how it is done than LISTEN how it is done

himayamata

Jusq tinuro ko lang to sa sarili ko, nasa muscle memory ko na. Pero mahirap pag one hand ahh nice vid

einalyriz

Tysvm now I know how to play Tower of Hanoi because me and all of my classmates are gonna play individually and all of us can choose to either play a Rubiks Cube, Tangram, or Tower of Hanoi Godbless😊☺️💜💚

cholocortez

Solution in text form:
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
A -> B
C -> B
C -> A
B -> A
C -> B
A -> C
A -> B
C -> B
C -> A
B -> A
B -> C
A -> C
B -> A
C -> B
C -> A
B -> A
C -> B
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
B -> A
C -> B
C -> A
B -> A
C -> B
A -> C
A -> B
C -> B
C -> A
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
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

hypnogri

Thanks for the tutorial I needed this for our presentation for our project in math

Toyota

Почаще бы были такие заносы)) приятно на них смотреть)

sophiegreer

Thank you its so helpful for my daughter☺☺😊😊

esmeraldaabatayo

let the rods be named as 1, 2, 3 from the screen left
if no. of disks are even move the smaller ring in the pattern of again the same
and do the possible change
if no. of disks are odd move the smaller ring in the pattern of 1---->3---->2 again the same

toonstore

My trick:
Odd number of disks you want to move for that step: (put the top disk where you want the stack to go)
Even number of disks you want to move for that step: (DON'T put the top disk where you want the stack to go)

strawberrywafer