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. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/FUZZY.2011.6007663 | FUZZ-IEEE |
Keywords | Field | DocType |
communicating sequential processes,depth first search algorithm,logical puzzle game,fillomino,puzzle solving algorithm,logical rules,puzzle game,logic programming,csp,computer science,genetic algorithms,algorithm design and analysis,tomography,algorithm design,evolutionary computation,cell line,evolutionary computing,depth first search,genetic algorithm,games | Algorithm design,Computer science,Communicating sequential processes,Logical rules,Depth-first search,Algorithm,Evolutionary computation,Artificial intelligence,Logic programming,Machine learning,Genetic algorithm | Conference |
ISSN | ISBN | Citations |
1098-7584 E-ISBN : 978-1-4244-7316-8 | 978-1-4244-7316-8 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shi-jim Yen | 1 | 134 | 27.99 |
Tsan-Cheng Su | 2 | 9 | 3.57 |
Shun-chin Hsu | 3 | 120 | 16.60 |