Show simple item record

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorGalleguillos C.
dc.contributor.authorParedes F.
dc.contributor.authorNorero E.
dc.date.accessioned2020-09-02T22:28:41Z
dc.date.available2020-09-02T22:28:41Z
dc.date.issued2015
dc.identifier10.1155/2015/286354
dc.identifier.citation2015, , -
dc.identifier.issn16875265
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6303
dc.descriptionThe 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.
dc.language.isoen
dc.publisherHindawi Limited
dc.titleA hybrid alldifferent-tabu search algorithm for solving sudoku puzzles
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record