Hybrid algorithms for solving Sudokus [Algoritmos híbridos para la resolución de Sudokus]
Autor
Soto R.
Galleguillos C.
Nino N.
Crawford B.
Paredes F.
Resumen
The 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.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Solving sudokus via metaheuristics and AC3 (2020)
Soto R.; Crawford B.; Galleguillos C.; Misra S.; Olguin E. (IEEE Computer Society, 2015) -
Conference Paper
A filtering technique for helping to solve sudoku problems (2020)
Soto R.; Crawford B.; Galleguillos C.; Crawford K.; Paredes F. (Springer Verlag, 2015) -
Article
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)