Solving sudokus via metaheuristics and AC3

RICARDO JAVIER SOTO DE GIORGIS, BRODERICK CRAWFORD LABRIN, Cristian Galleguillos, Sanjay Misra, Eduardo Olguin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationICAST 2014 - 2014 IEEE 6th International Conference on Adaptive Science and Technology, Proceedings
EditorsCharles K. Ayo, Sanjay Misra, Nicholas Omoregbe, Adewole Adewumi, Babafemi Odusote
PublisherIEEE Computer Society
ISBN (Electronic)9781479949984
DOIs
StatePublished - 25 Mar 2015
Event2014 6th IEEE International Conference on Adaptive Science and Technology, ICAST 2014 - Ota, Nigeria
Duration: 29 Oct 201431 Oct 2014

Publication series

NameIEEE International Conference on Adaptive Science and Technology, ICAST
Volume2015-January
ISSN (Print)2326-9413
ISSN (Electronic)2326-9448

Conference

Conference2014 6th IEEE International Conference on Adaptive Science and Technology, ICAST 2014
CountryNigeria
CityOta
Period29/10/1431/10/14

Keywords

  • Arc-consistency
  • Constraint Satisfaction
  • Sudoku

Fingerprint Dive into the research topics of 'Solving sudokus via metaheuristics and AC3'. Together they form a unique fingerprint.

Cite this