Playing the Minesweeper with Constraints

  • Raphaël Collet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3389)


We present the design and implementation of a Minesweeper game, augmented with a digital assistant. The assistant uses constraint programming techniques to help the player, and is able to play the game by itself. It predicts safe moves, and gives probabilistic information when safe moves cannot be found.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kaye, R.: Minesweeper is NP-complete. Mathematical Intelligencer (2000) See also,
  2. 2.
    Collet, R.: The Oz Minesweeper (2004) Program available at, (08/26/2004)
  3. 3.
    Mozart Consortium (DFKI, SICS, UCL, UdS): The Mozart programming system, Oz 3 (1999), Available at
  4. 4.
    Kopp, H.: Truffle-Swine Keeper (2001) Program available at , (08/26/2004)

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Raphaël Collet
    • 1
  1. 1.Université catholique de LouvainLouvain-la-NeuveBelgium

Personalised recommendations