A slightly questionable exploration of one of the oldest digital games: Minesweeper. This talk will in absolutely no way send us down the rabbit hole of computational complexity, million-dollar questions, or Turing completeness.

Sources and Further Reading:
https://minesweepergame.com/math/expl...
https://www.claymath.org/sites/defaul...
https://www.minesweeper.info/articles...
https://web.mat.bham.ac.uk/R.W.Kaye/m...

Errata:
At 5:55 I claim that if n = 1000, then the number of digits needed to display the output number would be larger than the number of atoms in the universe. This isn't quite right - it applies to the value of the number itself, not the number of digits.