Minesweeper isn't a hard game to solve, until you want to know all the possibilities of each square.
I will show you how to build a multiplayer Minesweeper game where you play against each other or a ruthless computer player.

To calculate the best possible move, the computer player needs to solve Minesweeper and calculate all possibilities. On an empty board of 16x16 with 51 mines, there are exactly 2E+54 possibilities. To crack this problem, I used a lot of optimizations to do this within 100ms.

In this talk, you'll learn about fancy data structures, benchmarking, memory profiling, and how to get the most performance out of complex algorithms in .NET.