Tower of Hanoi essentially is a mathematical puzzle that displays how recursion is utilised as a device in building up an algorithm to solve a specific problem. The Tower of Hanoi can be solved using a decision tree and a breadth-first search (BFS) algorithm in AI. With 3 disks, a puzzle can essentially be solved in 7 moves. However, the minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.