2026-03-07T19:04:04Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00235999 2025-01-19T09:26:06Z 6504:11678:11689

ZDDを用いたマインスイーパーの解法 前多, 健一 人工知能と認知科学 Minesweeper is one of the most popular games with incomplete information. To solve Minesweeper, the player must choose a move by inferring bomb locations based on the information disclosed as the game progresses, and sometimes by calculating probabilities. In this paper, we propose a method to solve Minesweeper by enumerating bomb locations using ZDD. This method includes several ideas to reduce computation time, some of which are effective to used to solve other problems with ZDD. Finally, we show the results of computer experiments on the win rate and solution time of the method. 情報処理学会 2024-03-01 jpn conference paper https://ipsj.ixsq.nii.ac.jp/records/235999 AN00349328 第86回全国大会講演論文集 2024 1 311 312 https://ipsj.ixsq.nii.ac.jp/record/235999/files/IPSJ-Z86-5Q-05.pdf application/pdf 295.4 kB 2024-07-03