Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 465359, 12 pages
Research Article

A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Universidad Autónoma de Chile, 7500138 Santiago, Chile
3Universidad Finis Terrae, 7501015 Santiago, Chile
4CNRS, LINA, University of Nantes, 44322 Nantes, France
5Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370109 Santiago, Chile

Received 11 November 2013; Accepted 30 December 2013; Published 23 February 2014

Academic Editors: Z. Cui and X. Yang

Copyright © 2014 Ricardo Soto et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The 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 grid, divided into nine 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.