A Logic Puzzle Solver by Selecting Smallest Branching Factor(Session 2)

スポンサーリンク

概要

• 論文の詳細を見る

• We made a puzzle solver for logic puzzles such as zebra-problem. We suggest an idea of a state space search by Selection of the Smallest Branching Factor. This idea is used to solve puzzles, and has the effect of decreasing the amount of the search. This idea is to make small branching factor the root of a search tree. And we use reasoning puzzles that is a kind of logic puzzle for evaluation. We show effectiveness of this idea by solving reasoning puzzles.

• 一般社団法人情報処理学会の論文
• 2005-09-05

著者

• Tajima Yasuhiro

  Department Of Computer Information And Communication Sciences Tokyo University Of Agriculture And Te

• Igarashi Chikara

  Department of Computer, Information and Communication Sciences Tokyo University of Agriculture and T

• Inui Nobuo

  Department of Computer, Information and Communication Sciences Tokyo University of Agriculture and T

• Kotani Yoshiyuki

  Department of Computer, Information and Communication Sciences Tokyo University of Agriculture and T

• Igarashi Chikara

  Department Of Computer Information And Communication Sciences Tokyo University Of Agriculture And Te

• Inui Nobuo

  Department Of Computer Information And Communication Sciences Tokyo University Of Agriculture And Te

• Kotani Yoshiyuki

  Department Of Computer Information And Communication Sciences Tokyo University Of Agriculture And Te

関連論文

• A Logic Puzzle Solver by Selecting Smallest Branching Factor(Session 2)

スポンサーリンク