Solving sudokus via metaheuristics and AC3

dc.contributor.author	Soto R.
dc.contributor.author	Crawford B.
dc.contributor.author	Galleguillos C.
dc.contributor.author	Misra S.
dc.contributor.author	Olguin E.
dc.date.accessioned	2020-09-02T22:28:40Z
dc.date.available	2020-09-02T22:28:40Z
dc.date.issued	2015
dc.identifier	10.1109/ICASTECH.2014.7068127
dc.identifier.citation	2015-January, , -
dc.identifier.issn	23269413
dc.identifier.uri	https://hdl.handle.net/20.500.12728/6300
dc.description	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. © 2014 IEEE.
dc.language.iso	en
dc.publisher	IEEE Computer Society
dc.source	Ayo C.K.Misra S.Omoregbe N.Adewumi A.Odusote B.
dc.subject	Arc-consistency
dc.subject	Constraint Satisfaction
dc.subject	Sudoku
dc.subject	Computer programming
dc.subject	Constraint theory
dc.subject	Approximate methods
dc.subject	Arc consistency
dc.subject	Constraint programming
dc.subject	Constraint Satisfaction
dc.subject	Filtering technique
dc.subject	Meta heuristics
dc.subject	Square matrices
dc.subject	Sudoku
dc.subject	Heuristic algorithms
dc.title	Solving sudokus via metaheuristics and AC3
dc.type	Conference Paper

Repositorio Académico