Due to the high volume and wide covering of topics from this courses' projects, I thought they would be worthwhile to share. The four main projects focused on, in order, (1) solving a contraint satisfaction problem with the hill-climbing algorithm, (2) using the minimax algorithm with alpha-beta pruning to solve for the optimal strategy of a sequential game, (3) making a Naive Bayes handwritten digit classifier with personally chosen, effective feature extraction methods, and (4) implementing high-performing Kalman Filters. All the material and code can be found in this
GitHub
repo.
