Tournament Manager Menu Tournament List TOH

Towers of Hanoi

00000001110000000
00000022222000000
00000333333300000
00004444444440000
00055555555555000
00666666666666600
07777777777777770
A(source)
00000000000000000
00000000000000000
00000000000000000
00000000000000000
00000000000000000
00000000000000000
00000000000000000
B(dest)
00000000000000000
00000000000000000
00000000000000000
00000000000000000
00000000000000000
00000000000000000
00000000000000000
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:

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 🗙