DocumentCode :
3123659
Title :
An efficient algorithm for solving Fillomino
Author :
Yen, Shi-Jim ; Su, Tsan-Cheng ; Hsu, Shun-Chin
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Dong Hwa Univ., Hualien, Taiwan
fYear :
2011
fDate :
27-30 June 2011
Firstpage :
190
Lastpage :
194
Abstract :
Fillomino is a logical puzzle game invented by Nikoli Company in Japan. Fillomino is played on a rectangular cell with no standard size; the internal cell lines are often dotted. Some cells of the cell start containing numbers, referred to as "givens". In this paper, we propose a puzzle solving algorithm to treat these problems. Based on the fact the Fillomino are compact and contiguous, some logical rules are deduced to paint some cells. Experimental results show that our algorithm can solve Fillominos successfully and efficient, and the processing speed is significantly faster than that of depth first search algorithm.
Keywords :
communicating sequential processes; logic programming; Fillomino; depth first search algorithm; logical puzzle game; logical rules; puzzle solving algorithm; Algorithm design and analysis; Computer science; Conferences; Evolutionary computation; Games; Genetic algorithms; Tomography; CSP; Fillomino; Puzzle Game;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fuzzy Systems (FUZZ), 2011 IEEE International Conference on
Conference_Location :
Taipei
ISSN :
1098-7584
Print_ISBN :
978-1-4244-7315-1
Electronic_ISBN :
1098-7584
Type :
conf
DOI :
10.1109/FUZZY.2011.6007663
Filename :
6007663
Link To Document :
بازگشت