Solving Japanese puzzles with logical rules and depth first search algorithm

Abstract

Japanese puzzle is one of logical games popular in Japan and Netherlands. Solving Japanese puzzle is a NP-complete problem. There are some related papers proposed. Some use genetic algorithm (GA), but the solution may be wrong. Some use depth first search (DFS) algorithm, which is an exhaustive search, the execution speed is very slow. In this paper, we propose a puzzle solving algorithm to treat these problems. Based on the fact that most of Japanese puzzle are compact and contiguous, some logical rules are deduced to paint some cells. Then, the DFS algorithm with the “branch and bound” scheme, which is used to do early termination for those impossible paths, is used to solve those undetermined cells. Experimental results show that our algorithm can solve Japanese puzzles successfully, and the processing speed is significantly faster than that of DFS.