Show simple item record

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorGalleguillos C.
dc.contributor.authorMisra S.
dc.contributor.authorOlguin E.
dc.date.accessioned2020-09-02T22:28:40Z
dc.date.available2020-09-02T22:28:40Z
dc.date.issued2015
dc.identifier10.1109/ICASTECH.2014.7068127
dc.identifier.citation2015-January, , -
dc.identifier.issn23269413
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6300
dc.descriptionThe 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.isoen
dc.publisherIEEE Computer Society
dc.sourceAyo C.K.Misra S.Omoregbe N.Adewumi A.Odusote B.
dc.subjectArc-consistency
dc.subjectConstraint Satisfaction
dc.subjectSudoku
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectApproximate methods
dc.subjectArc consistency
dc.subjectConstraint programming
dc.subjectConstraint Satisfaction
dc.subjectFiltering technique
dc.subjectMeta heuristics
dc.subjectSquare matrices
dc.subjectSudoku
dc.subjectHeuristic algorithms
dc.titleSolving sudokus via metaheuristics and AC3
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record