Sciweavers

2 search results - page 1 / 1
» The Minesweeper Game: Percolation And Complexity
Sort
View
CPC
2002
75views more  CPC 2002»
15 years 4 months ago
The Minesweeper Game: Percolation And Complexity
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
Elchanan Mossel
175
Voted
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 10 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek