Title
Solving sudokus via metaheuristics and AC3
Date Issued
25 March 2015
Access level
metadata only access
Resource Type
conference paper
Author(s)
Pontificia Universidad Católica de Valparaiso
Publisher(s)
IEEE Computer Society
Abstract
The Sudoku puzzle consists in filling a square matrix with 9 rows and 9 columns, divided into 9 3×3 regions, so that each column, row, and region contains different digits from 1 to 9. Such a puzzle belongs to the NP-complete class of problems, existing different exact and approximate methods able to solve it. This paper reports recent results for solving Sudokus achieved by combining metaheuristics and a filtering technique coming from the constraint programming domain named AC3.
Volume
2015-January
Language
English
OCDE Knowledge area
Ciencias de la computación
Subjects
Scopus EID
2-s2.0-84940116875
Source
IEEE International Conference on Adaptive Science and Technology, ICAST
ISSN of the container
23269413
ISBN of the container
9781479949984
Conference
IEEE International Conference on Adaptive Science and Technology, ICAST
Sponsor(s)
Covenant University
Ghana ICT Research Institute
Joint IEEE Communications and Computer Chapter
Joint IEEE Nigeria Section and Computer Society Chapter
Sources of information:
Directorio de Producción Científica
Scopus