/Tower_of_Hanoi_AI

After creating an optimized state space tree, Breadth First Search can be used to solve the famous Tower of Hanoi (TOH) problem. I have used simple c++ language in this case.

Primary LanguageC++

Watchers