CS50's AI course

Optimisation alogrithms such as Hill Climbing, its variants, Simulated Annealing were discussed. Linear Programming and Graph-constraint satisfaction problems were solved using python libraries. Node and Arc consistency was introduced. Backtracking Search algorithm was then applied to solve crosswords given a list of words to choose from. The techinique of loss functions was also then implemented on a physical robot to determine the best path for solving a maze. More information about that project over here. Watch the demo here.