Towers of Hanoi

TCS demo for the open day 2005 written in Scheme/OpenGL.


The problem of the Towers of Hanoi is a classic, that students of computer science traditionally have to solve pretty early. Since this problem has a great illustration potential, it was also choosen to be demonstrated at the booth of the theoretical computer science group (themed the boundaries of the computer) at the open day 2005.

The demo can't be playied manually, but the process of solving the problem can be executed by the computer at a definable delay time. This exact delay time is also used to compute the needed time to solve the problem. The demo is multilingual (english, german, french) and there are several color schemes to choose from.






Talking of Scheme I refer to DrScheme (MzScheme/MrEd).