.png){kind=icon}
.png){kind=icon}
Return
Minesweeper on graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.01.046.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Minesweeper is a popular single player game. It has been shown that the Minesweeper consistency problem is NP-complete and the Minesweeper counting problem is #P-complete. In this paper, we present efficient algorithms for solving these problems for Minesweeper graphs with bounded treewidth. Our algorithms turn out to be much better than those based directly on dynamic programming. The algorithms mostly use of algebraic operations on multivariate polynomials, so that one may use existing software to implement them easily. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Minesweeper
Counting problem
Consistency
Treewidth
Constraint satisfaction
CSP
Generating polynomials
Dynamic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available