Nurikabi Solver

Abstract

Nurikabe is logical puzzle game. Nurikabe puzzle normally has ‘m’ number of rows and ‘n’ number of columns. Even though it is a logical puzzle game, one cannot solve all the puzzles with pure set of logics. Because Nurikabe puzzle is a NP-complete game. Hence some assumptions must be made in order to solve the given puzzle. In this project in order to make this kind of assumptions with set of logics, SAT solver is used. SAT solver is an efficient tool to make the decisions with binary logics. SAT solver will accept only CNF format. So the puzzle rules and solving logics are converted into CNF format and given to SAT solver. Results from the SAT solver are checked with the rules and if the result satisfies the rules, then it is determined that the result as an appropriate solution for the given puzzle. And new Nurikabe puzzles also generated within certain limit in this project. SAT solver is used to generate new puzzles in this project.