This is another problem or puzzle that I first discovered when learning to code in Python. Given the problem, it was also a question that was asked to potential Facebook software developers, of how to solve it.
The programming algorithm is not much of a hurdle anymore with LLM’s, agents, and MCP servers doing all the logic and implementation work.
This recursive logic puzzle can be played at different levels. The discs represent the difficulty level. The more discs that need to be transferred between towers, the more difficult the game is. My implementation starts with 4 discs but can be played with up to 7 discs.
Tower of Hanoi