CS50's AI course

Learned about the following search algorithms: DFS, BFS, Greedy Best First Search, A* Search, Adversial Search: Mini-max (applied on Tic-Tac-Toe) and computationally efficient variations of Min-Max. Leveraged search alogrithm to make a physical robot solve a maze. More information about that project can be found here. Watch the demo here.