Solving Fillomino with Efficient Algorithm

• Item type: Symposium(1)
• 公開日: 2010-11-12
• タイトル: Solving Fillomino with Efficient Algorithm
• タイトル / 言語: en
• タイトル: Solving Fillomino with Efficient Algorithm
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_5794
• 資源タイプ: conference paper
• 著者所属: Department of Computer Science & Information Engineering, National Dong Hwa University
• 著者所属: Department of Computer Science & Information Engineering, National Dong Hwa University
• 著者所属: Department of Information Management, Chang Jung Christian University
• 著者所属(英): en
• 著者所属(英): Department of Computer Science & Information Engineering, National Dong Hwa University
• 著者所属(英): en
• 著者所属(英): Department of Computer Science & Information Engineering, National Dong Hwa University
• 著者所属(英): en
• 著者所属(英): Department of Information Management, Chang Jung Christian University
• 著者名: Shi-JimYen; Tsan-ChengSu; Shun-ChinHsu
• 著者名(英): Shi-Jim, Yen; Tsan-Cheng, Su; Shun-Chin, Hsu
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA12496601
• 書誌情報: ゲームプログラミングワークショップ2010論文集; 巻 2010, 号 12, p. 49-53, 発行日 2010-11-12
• 出版者 / 言語: ja
• 出版者: 情報処理学会