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.