Show simple item record

dc.contributor.authorSoto R.
dc.contributor.authorGalleguillos C.
dc.contributor.authorNino N.
dc.contributor.authorCrawford B.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:28:45Z
dc.date.available2020-09-02T22:28:45Z
dc.date.issued2015
dc.identifier10.1109/CISTI.2015.7170368
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6336
dc.descriptionThe aim of the Sudoku puzzle is filling with digits from 1 to 9 into each cell of a square matrix with 9 rows and 9 columns, divided into 9 3 × 3 regions, so that each column, row, and region contains have different values. This paper reports recent results for solving Sudokus achieved by combining metaheuristics and AC3 which is a filtering technique coming from the constraint programming domain. © 2015 AISTI.
dc.language.isoes
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectAC3
dc.subjectmetaheuristics
dc.subjectsudoku
dc.subjectAlgorithms
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectHeuristic algorithms
dc.subjectAC3
dc.subjectConstraint programming
dc.subjectFiltering technique
dc.subjectHybrid algorithms
dc.subjectMeta heuristics
dc.subjectSquare matrices
dc.subjectsudoku
dc.subjectSudoku puzzles
dc.subjectInformation systems
dc.titleHybrid algorithms for solving Sudokus [Algoritmos híbridos para la resolución de Sudokus]
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record