Playing the Minesweeper with Constraints
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.
- 1.Kaye, R.: Minesweeper is NP-complete. Mathematical Intelligencer (2000) See also,http://web.mat.bham.ac.uk/R.W.Kaye/minesw/ordmsw.htm(08/26/2004)
- 2.Collet, R.: The Oz Minesweeper (2004) Program available at, http://www.info.ucl.ac.be/~raph/minesweeper/ (08/26/2004)
- 3.Mozart Consortium (DFKI, SICS, UCL, UdS): The Mozart programming system, Oz 3 (1999), Available at http://www.mozart-oz.org
- 4.Kopp, H.: Truffle-Swine Keeper (2001) Program available at ,http://people.freenet.de/hskopp/swinekeeper.html (08/26/2004)