Solving Nurikabe with Monte-Carlo Tree Serach

Abstract

Puzzle solving with AI is becoming one of the hot topic fields in computer science. The algorithmic challenges that are laid behind this topic , make it more attractive. One of these NP-complete puzzles that is hard to solve for human being is Nurikabe Puzzle . few methods have been developed for solving this puzzle that have a poor performance in time and memory. Monte-Carlo Tree Search(MCTS) is a famous reinforcement algorithm that have been used in many Logical games .In this article we use Monte-Carlo Tree Search method for creating the efficient method that performs well on time that it takes for solving the puzzle .no one have ever used this method for solving this problem and also we test our algorithm with a wide range of test cases from easy to hardest ones.