A hybrid alldifferent-tabu search algorithm for solving sudoku puzzles

Vista sencilla de ítem
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorGalleguillos C.es_ES
dc.contributor.authorParedes F.es_ES
dc.contributor.authorNorero E.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-06-22T18:57:39Z
dc.date.available6/22/2022 13:33
dc.date.available2022-06-22T18:57:39Z
dc.date.issued2015
dc.description.abstractThe Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n2 × n2 grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n2. Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods. © 2015 Ricardo Soto et al.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1155/2015/286354es_ES
dc.identifier.urihttps://doi.org/10.1155/2015/286354
dc.language.isoenges_ES
dc.publisherHindawi Publishing Corporationes_ES
dc.relation.ispartofComputational Intelligence and Neurosciencees_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.sourceComputational Intelligence and Neurosciencees_ES
dc.subjectComputer Sciencees_ES
dc.subjectMathematicses_ES
dc.subjectNeurosciencees_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.00.00es_ES
dc.titleA hybrid alldifferent-tabu search algorithm for solving sudoku puzzleses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
11. A hybrid alldifferent-tabu search algorithm for solving sudoku puzzles.pdf
Tamaño:
819.5 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Artículo