Sudoku as a Constraint Satisfaction Problem
نویسنده
چکیده
Purpose of this paper is to approach and solve Sudoku as a Constraint Satisfaction Problem and to compare various heuristics and their effects on solving the problem. Heuristics compared include Backtracking with Forward Checking and Minimum Remaining Value, Arc Consistency, and Arc Consistency Pre-Processing.
منابع مشابه
A Hybrid Heuristic Approach for the Sudoku problem
Sudoku is not only a popular puzzle but also an interesting constraint satisfaction problem. Therefore automatic solving methods for this problem have been the subject of several publications in the last decade. While some authors propose algorithms which make use of constraint programming techniques, others propose meta-heuristics and stochastic search to tackle larger instances of the puzzle....
متن کاملSolving Constraint Satisfaction Puzzles with Constraint Programming
Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of...
متن کاملRating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems
Sudoku is a logic-based combinatorial puzzle game which people in different ages enjoy playing it. The challenging and addictive nature of this game has made it a ubiquitous game. Most magazines, newspapers, puzzle books, etc. publish lots of Sudoku puzzles every day. These puzzles often come in different levels of difficulty so that all people, from beginner to expert, can play the game and en...
متن کاملHeuristic Reasoning on Graph and Game Complexity of Sudoku
The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. Sudoku is always considered as Satisfiability Problem or Constraint Satisfaction Problem. In this paper, we propose to focus on the essential graph structure underlying the Sudoku puzzle. First, we formalize Sudoku as a graph. Then a solving algorithm based on...
متن کاملOverlapping Alldiff constraints: SAT versus CSP encoding application to the Sudoku
Constraint satisfaction problems (CSP) or Boolean satisfiability problem (SAT) are two well-known paradigms to model and solve combinatorial problems. Modeling and resolution of CSP is often strengthened by global constraints (e.g., Alldiff constraint). This paper highlights two different ways of handling specific structural information: a uniform propagation framework to handle (interleaved) A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012