How to Produce BlockSum Instances with Various Levels of Difficulty
スポンサーリンク
概要
- 論文の詳細を見る
We propose a framework that yields instances of certain combinatorial puzzles. To explore such a framework, we focus on certain types of puzzles that ask an assignment of numbers to the cells of an n × n grid so that it satisfies certain constraints as well as the Latin square condition, that is, each row and column contains all of the numbers in {1,2,...,n}. Our algorithm based on the framework automatically yields puzzle instances whose difficulties to solve can be adjusted by means of puzzle inference rules built into the algorithm. Taking up BlockSum puzzle for example, we performed experiments to demonstrate that, as is expected, human solvers tend to solve puzzle instances correctly that are produced with easy inference rules, whereas they tend to fail to solve those produced with sophisticated rules.
- 2012-06-15
著者
-
Akira Maruoka
Department Of Information Technology And Electronics Faculty Of Science And Engineering Ishinomaki S
-
Kazuya Haraguchi
Department of Information Technology and Electronics, Faculty of Science and Engineering, Ishinomaki
-
Yasutaka Abe
Department of Information Technology and Electronics, Faculty of Science and Engineering, Ishinomaki
-
Yasutaka Abe
Department Of Information Technology And Electronics Faculty Of Science And Engineering Ishinomaki S
-
Kazuya Haraguchi
Department Of Information Technology And Electronics Faculty Of Science And Engineering Ishinomaki S
関連論文
- How to Produce BlockSum Instances with Various Levels of Difficulty
- The Number of Inequality Signs in the Design of Futoshiki Puzzle (Preprint)