As a simple assignment for my Introduction to Artificial Intelligence course (CSE 486) at Miami University, we were tasked with building a simple chess engine which makes use of the minimax algorithm with alpha-beta pruning.

Now admittedly, I am not horribly competent at playing chess. While I know how the pieces move, at least before writing this, I lacked a basic understanding of strategy. Nonetheless however, I will do my best to explain how the engine works, what and why minimax with alpha-beta pruning is used, and how you can run this code.