Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Collet, R.: The Oz Minesweeper (2004) Program available at, http://www.info.ucl.ac.be/~raph/minesweeper/ (08/26/2004)
Mozart Consortium (DFKI, SICS, UCL, UdS): The Mozart programming system, Oz 3 (1999), Available at http://www.mozart-oz.org
Kopp, H.: Truffle-Swine Keeper (2001) Program available at , http://people.freenet.de/hskopp/swinekeeper.html (08/26/2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Collet, R. (2005). Playing the Minesweeper with Constraints. In: Van Roy, P. (eds) Multiparadigm Programming in Mozart/Oz. MOZ 2004. Lecture Notes in Computer Science, vol 3389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31845-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-31845-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25079-1
Online ISBN: 978-3-540-31845-3
eBook Packages: Computer ScienceComputer Science (R0)