Tokyo University of Information Sciences,Faculty of Informatics,Department of Information Systems
Abstract
本論文では、離散組み合わせ問題、特に、地図の彩色問題とクロスワードパズル問題を制約充足問題として定式化するとともに、整合化手法を用いた制約充足解法を適用し、その有効性を示す。In this paper, we describe a formalization of discrete combinatorial problems from viewpoint of constraint satisfaction problems and the consistency methods for constraint satisfaction problems. Effectiveness of these consistency methods is shown using application of these methods to map coloring problem and crossword puzzle problem
