Towers of Hanoi is a classic programming puzzle. Traditionally, there is a stack of discs, each smaller the the one below it, on the leftmost rod. The goal is to move all the disks to the rightmost rod, with the following rules:

• You may only move one disk at a time
• Each move consists of taking a disk at the top of one rod and moving it to another rod
• You may not place a disk on top of a smaller disk

Sandbox: Uses your input on the towers

Recursion: Uses the classic recursion technique

BFS: Uses a breadth-first search technique

DFS: Uses a depth-first search technique

Q-Learning: Uses a Q-learning technique