# ‘Minesweeper’ and spectrum of discrete Laplacians

@article{German2010MinesweeperAS, title={‘Minesweeper’ and spectrum of discrete Laplacians}, author={Oleg German and Evgeny Lakshtanov}, journal={Applicable Analysis}, year={2010}, volume={89}, pages={1907 - 1916} }

The article is devoted to a problem inspired by the ‘Minesweeper’ computer game. It is shown that certain configurations of open cells guarantee the existence and the uniqueness of solution. Mathematically the problem is reduced to some spectral properties of discrete differential operators. It is shown how the uniqueness can be used to create a new game which preserves the spirit of ‘Minesweeper’ but does not require a computer.

## 3 Citations

### Examples of admissible simplification of mathematical theories

- EducationKybernetes
- 2011

This work gives examples of simplified math models that satisfy the claimed concept, accompanied with the set of problems attainable for primary school pupils, based on some maxima given in a paper written by Zvonkin.

## References

SHOWING 1-3 OF 3 REFERENCES

### The Minesweeper Game: Percolation and Complexity

- MathematicsCombinatorics, Probability and Computing
- 2002

A model motivated by the minesweeper game, in which one starts with the percolation of mines on the lattice ℤd, and then tries to find an infinite path of mine-free sites, is studied.

### Minesweeper is NP-complete

- Computer Science
- 2000

NP-completeness Many programming p rob lems require the design of an algori thm which has a "yes" or "no" ou tput for each input, and there are two classes of p rob l ems that are of grea tes t in teres t for complexi tytheoris ts.