Hybrid algorithms for solving Sudokus [Algoritmos híbridos para la resolución de Sudokus]

dc.contributor.author	Soto R.
dc.contributor.author	Galleguillos C.
dc.contributor.author	Nino N.
dc.contributor.author	Crawford B.
dc.contributor.author	Paredes F.
dc.date.accessioned	2020-09-02T22:28:45Z
dc.date.available	2020-09-02T22:28:45Z
dc.date.issued	2015
dc.identifier	10.1109/CISTI.2015.7170368
dc.identifier.uri	https://hdl.handle.net/20.500.12728/6336
dc.description	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.
dc.language.iso	es
dc.publisher	Institute of Electrical and Electronics Engineers Inc.
dc.subject	AC3
dc.subject	metaheuristics
dc.subject	sudoku
dc.subject	Algorithms
dc.subject	Computer programming
dc.subject	Constraint theory
dc.subject	Heuristic algorithms
dc.subject	AC3
dc.subject	Constraint programming
dc.subject	Filtering technique
dc.subject	Hybrid algorithms
dc.subject	Meta heuristics
dc.subject	Square matrices
dc.subject	sudoku
dc.subject	Sudoku puzzles
dc.subject	Information systems
dc.title	Hybrid algorithms for solving Sudokus [Algoritmos híbridos para la resolución de Sudokus]
dc.type	Conference Paper

Repositorio Académico