TY - GEN
T1 - Solving sudokus via metaheuristics and AC3
AU - SOTO DE GIORGIS, RICARDO JAVIER
AU - CRAWFORD LABRIN, BRODERICK
AU - Galleguillos, Cristian
AU - Misra, Sanjay
AU - Olguin, Eduardo
PY - 2015/3/25
Y1 - 2015/3/25
N2 - 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.
AB - 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.
KW - Arc-consistency
KW - Constraint Satisfaction
KW - Sudoku
UR - http://www.scopus.com/inward/record.url?scp=84940116875&partnerID=8YFLogxK
U2 - 10.1109/ICASTECH.2014.7068127
DO - 10.1109/ICASTECH.2014.7068127
M3 - Conference contribution
AN - SCOPUS:84940116875
T3 - IEEE International Conference on Adaptive Science and Technology, ICAST
BT - ICAST 2014 - 2014 IEEE 6th International Conference on Adaptive Science and Technology, Proceedings
A2 - Ayo, Charles K.
A2 - Misra, Sanjay
A2 - Omoregbe, Nicholas
A2 - Adewumi, Adewole
A2 - Odusote, Babafemi
PB - IEEE Computer Society
Y2 - 29 October 2014 through 31 October 2014
ER -