DocumentCode :
2240048
Title :
Optimization of Nonogram´s Solver by Using an Efficient Algorithm
Author :
Yen, Shi-Jim ; Su, Tsan-Cheng ; Chiu, Shih-Yuan ; Chen, Chang, Jr.
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Dong Hwa Univ., Hualien, Taiwan
fYear :
2010
fDate :
18-20 Nov. 2010
Firstpage :
444
Lastpage :
449
Abstract :
Nonogram is an extremely popular game of logic in Japan and Holland. Solving a Nonogram is difficult because it is an NP-complete problem. Some studies have applied logical rules, and then, to improve the searching efficiency, used Backtracking to solve the cells that logical rules provides a method that is based on the basic rules to solve for Nonogram puzzle quickly. Our method is an easy and fast algorithm. A database and our algorithm, can be used together to solve Nonograms at very high speed. Experimental results show that our algorithm can successfully and efficiently solve Nonograms.
Keywords :
computational complexity; game theory; optimisation; NP complete problem; Nonogram solver; logic; optimization; Algorithm; Japan Puzzle; Nonogram; Puzzle Game; Solver;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Technologies and Applications of Artificial Intelligence (TAAI), 2010 International Conference on
Conference_Location :
Hsinchu City
Print_ISBN :
978-1-4244-8668-7
Electronic_ISBN :
978-0-7695-4253-9
Type :
conf
DOI :
10.1109/TAAI.2010.95
Filename :
5695490
Link To Document :
بازگشت