A Constraint-Based Approach to Solving Minesweeper

Authors

Ken Bayer, University of Nebraska-LincolnFollow
Josh Snyder, University of Nebraska-LincolnFollow
Berthe Y. Choueiry, University of Nebraska-LincolnFollow

Date of this Version

2006

Comments

Bayer, Snyder & Choueiry in Proceedings of the National Conference on Artificial Intelligence (AAAI 2006, Boston, Massachussets). Pages 1,933-1,934. Copyright 2006, AAAI. Used by permission.

Abstract

·Motivate the students for the study of Constraint Processing (CP). Minesweeper is perfect to this end because it allows us to illustrate the use of CP algorithms in a familiar context and show how they operate.

·Understand and demystify humans’ fascination with puzzles.

·Discourage graduate students from losing too much time playing the game by making a program that plays the game for them.