Mostrar el registro sencillo del ítem

A prefiltered cuckoo search algorithm with geometric operators for solving Sudoku problems

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorGalleguillos C.
dc.contributor.authorMonfroy E.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:28:40Z
dc.date.available2020-09-02T22:28:40Z
dc.date.issued2014
dc.identifier10.1155/2014/465359
dc.identifier.citation2014, , -
dc.identifier.issn1537744X
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6302
dc.descriptionThe Sudoku is a famous logic-placement game, originally popularized in Japan and today widely employed as pastime and as testbed for search algorithms. The classic Sudoku consists in filling a 9 × 9 grid, divided into nine 3 × 3 regions, so that each column, row, and region contains different digits from 1 to 9. This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it. In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations. The geometric operators allow one to correctly move toward promising regions of the combinatorial space, while the prefiltering phases are able to previously delete from domains the values that do not conduct to any feasible solution. This integration leads to a more efficient domain filtering and as a consequence to a faster solving process. We illustrate encouraging experimental results where our approach noticeably competes with the best approximate methods reported in the literature. © 2014 Ricardo Soto et al.
dc.language.isoen
dc.publisherScientificWorld Ltd.
dc.titleA prefiltered cuckoo search algorithm with geometric operators for solving Sudoku problems
dc.typeArticle


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84897015194.pdf
Tamaño:
2.114Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem