Skip to Main content Skip to Navigation

MineSweeper: Where to Probe?

Marc Legendre 1 Kévin Hollard 1 Olivier Buffet 1 Alain Dutech 1 
1 MAIA - Autonomous intelligent machine
Inria Nancy - Grand Est, LORIA - AIS - Department of Complex Systems, Artificial Intelligence & Robotics
Abstract : Most research about the game of Minesweeper has focussed on inferring which cells may or may not contain a mine, discussing the complexity of this problem (and its variants) and proposing efficient resolution techniques. While this inference task is indeed crucial to playing Minesweeper, this paper comes back to the original game as a whole, modelling it as a sequential decision-making problem ---more precisely as a Partially Observable Markov Decision Process (POMDP)--- before proposing and studying various heuristics to solve the key problem of selecting the next cell to play.
Document type :
Complete list of metadata
Contributor : Olivier Buffet Connect in order to contact the contributor
Submitted on : Friday, August 10, 2012 - 2:15:47 PM
Last modification on : Saturday, June 25, 2022 - 7:41:45 PM
Long-term archiving on: : Sunday, November 11, 2012 - 2:26:23 AM


Files produced by the author(s)


  • HAL Id : hal-00723550, version 1


Marc Legendre, Kévin Hollard, Olivier Buffet, Alain Dutech. MineSweeper: Where to Probe?. [Research Report] RR-8041, INRIA. 2012, pp.26. ⟨hal-00723550⟩



Record views


Files downloads