Tower of Hanoi is a mathematical puzzle that displays how recursion might be used as a device in creating up an algorithm to take care of a specific problem. Further, for solving the tower of Hanoi a decision tree and a breadth-first search (BFS) algorithm in AI is used.