WEKO3
アイテム
Solving Slitherlink with FPGA and SMT Solver
https://ipsj.ixsq.nii.ac.jp/records/208836
https://ipsj.ixsq.nii.ac.jp/records/2088366cd839d6-3bc1-4a88-8f58-1d7e85a95b21
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL6112026.pdf (892.9 kB)
|
Copyright (c) 2020 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2020-12-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Solving Slitherlink with FPGA and SMT Solver | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Solving Slitherlink with FPGA and SMT Solver | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：離散と計算の幾何・グラフ・ゲーム] Slitherlink, FPGA, SMT solver, Z3 | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Japan Advanced Institute of Science and Technology | ||||||||||
| 著者所属 | ||||||||||
| Japan Advanced Institute of Science and Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Japan Advanced Institute of Science and Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Japan Advanced Institute of Science and Technology | ||||||||||
| 著者名 |
Tetsuo, Miyauchi
× Tetsuo, Miyauchi
× Kiyofumi, Tanaka
|
|||||||||
| 著者名(英) |
Tetsuo, Miyauchi
× Tetsuo, Miyauchi
× Kiyofumi, Tanaka
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | “Slitherlink” is one of popular pencil puzzles. The purpose of the puzzle is to make a link according to the digits written in cells. While determining the existence of a solution to a given puzzle is proved to be an NP-complete class of problems, which means it is difficult to find an effective algorithm to solve the puzzle, solving the puzzle has been studied and there are several previous researches for the puzzle. In this paper, we show two new methods to solve the puzzle. One is with hardware acceleration on an FPGA and the other is based on an SMT solver. We focus on determining inside or outside for each cell instead of making a link and propose a new formulation. With hardware acceleration, it takes 0.1578 seconds on average for solving 10 × 10 puzzles, and with an SMT solver, our solution is faster than previous researches in most cases. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.28(2020) (online) DOI http://dx.doi.org/10.2197/ipsjjip.28.959 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | “Slitherlink” is one of popular pencil puzzles. The purpose of the puzzle is to make a link according to the digits written in cells. While determining the existence of a solution to a given puzzle is proved to be an NP-complete class of problems, which means it is difficult to find an effective algorithm to solve the puzzle, solving the puzzle has been studied and there are several previous researches for the puzzle. In this paper, we show two new methods to solve the puzzle. One is with hardware acceleration on an FPGA and the other is based on an SMT solver. We focus on determining inside or outside for each cell instead of making a link and propose a new formulation. With hardware acceleration, it takes 0.1578 seconds on average for solving 10 × 10 puzzles, and with an SMT solver, our solution is faster than previous researches in most cases. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.28(2020) (online) DOI http://dx.doi.org/10.2197/ipsjjip.28.959 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 61, 号 12, 発行日 2020-12-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
