Tournament Manager

Menu Tournament List TOH

Towers of Hanoi

0	0	0	0	0	0	0	1	1	1	0	0	0	0	0	0	0
0	0	0	0	0	0	2	2	2	2	2	0	0	0	0	0	0
0	0	0	0	0	3	3	3	3	3	3	3	0	0	0	0	0
0	0	0	0	4	4	4	4	4	4	4	4	4	0	0	0	0
0	0	0	5	5	5	5	5	5	5	5	5	5	5	0	0	0
0	0	6	6	6	6	6	6	6	6	6	6	6	6	6	0	0
0	7	7	7	7	7	7	7	7	7	7	7	7	7	7	7	0
A(source)

0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
B(dest)

0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
C(spare)

Select Height:

This is a famouse problem (among programmers/maths students) called Towers of Hanoi.

It is famouse because it can be solved elegantly with an algorithm using technique called recursion.

Objective is to move the tower (stack of discs) from A to B using C as a spare space. Rules are:

Move one disc at a time.
You can stack only smaller disc on top of larger disc.

button will demonstrate how to solve.

button is a X'mas extra (a bit too late)

An error has occurred. This application may no longer respond until reloaded. Reload 🗙