SOLVING JAPANESE PUZZLES WITH LOGICAL RULES AND DEPTH FIRST SEARCH ALGORITHM

Min-Quan Jing, Chiung-Hsueh Yu, Hui-Lung Lee, Ling-Hwei Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

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.

Original languageEnglish
Title of host publicationPROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6
PublisherIEEE
Pages2962-2967
Number of pages6
ISBN (Print)978-1-4244-4705-3
DOIs
StatePublished - 2009
Event2009 International Conference on Machine Learning and Cybernetics - Baoding, China
Duration: 12 Jul 200915 Jul 2009

Conference

Conference2009 International Conference on Machine Learning and Cybernetics
CountryChina
CityBaoding
Period12/07/0915/07/09

Keywords

  • Japanese puzzle; Nonogram; Depth first search; Branch and bound

Fingerprint Dive into the research topics of 'SOLVING JAPANESE PUZZLES WITH LOGICAL RULES AND DEPTH FIRST SEARCH ALGORITHM'. Together they form a unique fingerprint.

  • Cite this

    Jing, M-Q., Yu, C-H., Lee, H-L., & Chen, L-H. (2009). SOLVING JAPANESE PUZZLES WITH LOGICAL RULES AND DEPTH FIRST SEARCH ALGORITHM. In PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6 (pp. 2962-2967). IEEE. https://doi.org/10.1109/ICMLC.2009.5212614