@techreport{oai:ipsj.ixsq.nii.ac.jp:00169421,
 author = {Hirofumi, Suzuki and Sun, Hao and Shin-ichi, Minato and Hirofumi, Suzuki and Sun, Hao and Shin-ichi, Minato},
 issue = {3},
 month = {Jul},
 note = {Minesweeper is one of the most popular puzzle game. Several kinds of decision or counting problems on Minesweeper have been studied. In this paper, we consider the problem to generate all possible solutions for a given Minesweeper board, and propose a new formulation of the problem using a graph structure, called degree constrained subgraph model. We show experimental results of our efficient graph enumeration techniques for various sizes of Minesweeper boards., Minesweeper is one of the most popular puzzle game. Several kinds of decision or counting problems on Minesweeper have been studied. In this paper, we consider the problem to generate all possible solutions for a given Minesweeper board, and propose a new formulation of the problem using a graph structure, called degree constrained subgraph model. We show experimental results of our efficient graph enumeration techniques for various sizes of Minesweeper boards.},
 title = {Generating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model},
 year = {2016}
}