‘Minesweeper’ and spectrum of discrete Laplacians
暂无分享,去创建一个
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.
[1] Elchanan Mossel. The Minesweeper Game: Percolation And Complexity , 2002, Comb. Probab. Comput..
[2] Andrew Adamatzky. How cellular automaton plays Minesweeper , 1997 .
[3] R. Kaye. Minesweeper is NP-complete , 2000 .