Which Knowledge Avatar?
This program solves the Tower of Hanoi problem by itself. In the tower of Hanoi problem you have three columns. The goal is to move all the discs from the first column to the third column without ever having a larger disc on top of a smaller disc. You can only move one disc at a time.