This was second project for CS520 - Introduction to Artificial Intelligence. As the name suggests, the project goal was to create a computer bot which can play Minesweeper at different difficulty levels. We created 3 different solvers:
Basic Solver - The basic solver is the most risk-free solver which will not think on its own but just play the safest moves possible. It will stop the game if there are no further safe moves possible. It is a baseline model which we developed to evaluate the accuracy and effectiveness of the other complex models.
CSP Solver: This is the main bot which plays the game just like humans. CSP refers to Constraint Satisfaction Problem since this is the main algorithm used by the agent. It plays the game just like a normal human - by creating different constraints for each square opened and each mine flagged. When it opens a cell or flags it, the knowledge base is updated and the constraints/equations are resolved.
Bonus CSP Solver: This is just en extension of the the CSP solver. Unlike a typical mineweeper game where the agent will know what lies behind a cell once it is opened, this solver will only get the information with some probability. Hence, if it opens a cell, there is an 80% chance of the agent receiving the correct information.
The left image displays the true underlying mine environment which is hidden from the agent. On the right, the sequence of moves of our bot as it opens the cells and flags those cells it thinks as mines.