In my Artifical Intelligence class, we were asked to create two multiplayer games using the MiniMax algorithm. This algorithm has a computer player choose intelligent moves to play based off the current game state. The games we made weren’t very fun and highly unusual, so I decided to implement the classic game of Reversi to test out the algorithm.
For my fourth year Artificial Intelligence course, our first assignment was to implement the classic game Snake. The hard part was then to implement three different search algorithms so the snake will find the food by itself. The three search algorithms were Breadth First Search, Depth First Search, and A* Search.