Tuesday, January 24, 2012
New Robot Challenge "Tower of Hanoi" 2012
On December 2, 2011 five teams from RWTH Aachen, Karlsruhe Institute of Technology, Bonn-Rhein-Sieg Univ. of Applied Science and TU Graz competed at the London Science Museum to solve the well known "Tower of Hanoi" problem" with the help of a mobile robot.
The problem has been known to generations of computer science students and is also an important problem for robotics research and education . It allows studying and learning the concept of recursion in algorithm design. The task is to move a pile of disks with the smallest number of moves from one location to another while obeying certain rules.
Despite available open source software and amazing performance non of the five teams managed to completely solve the task in the give time.
Since the jackpot of total 3000 Euro was not hit in the first event it will be rolled over to the 2012 event.
Time and venue of the 2012 Tower of Hanoi for Robotics Contest will be announced.