⚡ Minesweeper Is Hard - Keegan R

Published on ● Video Link: https://www.youtube.com/watch?v=ycPDDnQh2qE



Duration: 15:23
55,606 views
2,864


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/explorations-of-the-minesweeper-consistency-problem-2003.pdf
https://www.claymath.org/sites/default/files/minesweeper.pdf
https://www.minesweeper.info/articles/SomeMinesweeperConfigurations.pdf
https://web.mat.bham.ac.uk/R.W.Kaye/minesw/infmsw.pdf

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.







Tags:
minesweeper
turing completeness
lightning talk
complexity
computing society
talk