Exploring the field of AI
Build an adversarial game playing agent by implementing techniques such as Iterative Deepening and Alpha Beta pruning.
Build, apply and compare search algorithms (BFS, DFS, UCS, A*) to efficiently collect food on the way to a target location. This project explores finding good heuristics and effectively implementing suboptimal search.
This project is created by UC Berkeley's AI division and can be found here.
Apply Simulated Annealing to solve the travelling salesman problem.
Use constraint satisfaction to efficiently solve Sudoku.
Use Hidden Markov Models to transform sign language data into text.