Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-27T23:52:51.616Z Has data issue: false hasContentIssue false
  • English
  • Français

The Minesweeper Game: Percolation and Complexity

Published online by Cambridge University Press:  09 October 2002

ELCHANAN MOSSEL
ELCHANAN MOSSEL
Affiliation:
Institute of Mathematics, The Hebrew University of Jerusalem, Giv'at Ram, Jerusalem 91904, Israel and Microsoft Research, 1 Microsoft Way, Redmond, WA 98052, USA (e-mail: mossel@math.huji.ac.il)
Get access Rights & Permissions [Opens in a new window]

Abstract

We study a model motivated by the minesweeper game. In this model one starts with the percolation of mines on the lattice ℤd, and then tries to find an infinite path of mine-free sites. At every recovery of a free site, the player is given some information on the sites adjacent to the current site. We compare the parameter values for which there exists a strategy such that the process survives to the critical parameter of ordinary percolation. We then derive improved bounds for these values for the same process, when the player has some complexity restrictions in computing his moves. Finally, we discuss some monotonicity issues which arise naturally for this model.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 11 , Issue 5 , September 2002 , pp. 487 - 499
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)