Solving sudokus via metaheuristics and AC3
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Conference PaperSoto R.; Galleguillos C.; Nino N.; Crawford B.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)
Using autonomous search for solving constraint satisfaction problems via new modern approaches (2020) Soto R.; Crawford B.; Olivares R.; Galleguillos C.; Castro C.; Johnson F.; Paredes F.; Norero E. (Elsevier B.V., 2016)
ArticleSoto R.; Crawford B.; Olivares R.; Niklander S.; Johnson F.; Paredes F.; Olguín E. (Springer Netherlands, 2017)