Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 465359, 12 pages
http://dx.doi.org/10.1155/2014/465359
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.

Linked References

  1. T. Mantere and J. Koljonen, “Solving, rating and generating sudoku puzzles with GA,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '07), pp. 1382–1389, IEEE Computer Society, Singapore, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. F. Rossi, P. van Beek, and T. Walsh, Handbook of Constraint Programming, Elsevier, 2006.
  3. T. K. Moon and J. H. Gunther, “Multiple constraint satisfaction by belief propagation: an example using sudoku,” in Proceedings of the IEEE Mountain Workshop on Adaptive and Learning Systems, pp. 122–126, Logan, Utah, USA, July 2006. View at Publisher · View at Google Scholar · View at Scopus
  4. H. Simonis, “Sudoku as a constraint problem,” in Proceedings of the 4th International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pp. 13–27, Barcelona, Spain, 2005.
  5. I. Lynce and J. Ouaknine, “Sudoku as a SAT problem,” in Proceedings of the International Symposium on Artificial Intelligence and Mathematics (ISAIM '06), Fort Lauderdale, Fla, USA, 2006.
  6. A. Moraglio, J. Togelius, and S. Lucas, “Product geometric crossover for the sudoku puzzle,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), pp. 470–476, IEEE Computer Society, Vancouver, Canada, July 2006. View at Scopus
  7. R. Lewis, “Metaheuristics can solve sudoku puzzles,” Journal of Heuristics, vol. 13, no. 4, pp. 387–401, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Moraglio and J. Togelius, “Geometric particle swarm optimization for the sudoku puzzle,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 118–125, ACM Press, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. T. Mantere and J. Koljonen, “Solving and analyzing sudokus with cultural algorithms,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '08), pp. 4053–4060, IEEE Computer Society, Hong Kong, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. M. Asif and R. Baig, “Solving NP-complete problem using ACO algorithm,” in Proceedings of the International Conference on Emerging Technologies (ICET '09), pp. 13–16, IEEE Computer Society, Islamabad, Pakistan, October 2009.
  11. T. K. Moon, J. H. Gunther, and J. J. Kupin, “Sinkhorn solves sudoku,” IEEE Transactions on Information Theory, vol. 55, no. 4, pp. 1741–1746, 2009. View at Google Scholar
  12. G. Santos-García and M. Palomino, “Solving sudoku puzzles with rewriting rules,” Electronic Notes in Theoretical Computer Science, vol. 176, no. 4, pp. 79–93, 2007. View at Publisher · View at Google Scholar · View at Scopus
  13. J. Gunther and T. K. Moon, “Entropy minimization for solving sudoku,” IEEE Transactions on Signal Processing, vol. 60, no. 1, pp. 508–513, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. X.-S. Yang and S. Deb, “Cuckoo search via lévy flights,” in Proceedings of the World Congress on Nature and Biologically Inspired Computing (NABIC '09), pp. 210–214, IEEE, Coimbatore, India, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. X.-S. Yang and S. Deb, “Multiobjective cuckoo search for design optimization,” Computers & Operations Research, vol. 40, no. 6, pp. 1616–1624, 2013. View at Google Scholar
  16. P. R. Srivastava, A. Varshney, P. Nama, and X.-S. Yang, “Software test effort estimation: a model based on cuckoo search,” International Journal of Bio-Inspired Computation, vol. 4, no. 5, pp. 278–285, 2012. View at Google Scholar
  17. M. K. Marichelvam, “An improved hybrid cuckoo search (ihcs) metaheuristics algorithm for permutation flow shop scheduling problems,” International Journal of Bio-Inspired Computation, vol. 4, no. 4, pp. 200–205, 2012. View at Google Scholar
  18. A. Gherboudj, A. Layeb, and S. Chikhi, “Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm,” International Journal of Bio-Inspired Computation, vol. 4, no. 4, pp. 229–236, 2012. View at Google Scholar
  19. B. Crawford, M. Aranda, C. Castro, and E. Monfroy, “Using constraint programming to solve sudoku puzzles,” in Proceedings of the 3rd International Conference on Convergence and Hybrid Information Technology (ICCIT '08), pp. 926–931, IEEE Computer Society, Busan, Republic of Korea, November 2008. View at Publisher · View at Google Scholar · View at Scopus
  20. R. Soto, B. Crawford, C. Galleguillos, E. Monfroy, and F. Paredes, “A hybrid ac3-tabu search algorithm for solving sudoku puzzles,” Expert Systems with Applications, vol. 40, no. 15, pp. 5817–5821, 2013. View at Google Scholar
  21. A. K. Mackworth, “Consistency in networks of relations,” Artificial Intelligence, vol. 8, no. 1, pp. 99–118, 1977. View at Google Scholar · View at Scopus
  22. A. Mackworth, “On reading sketch maps,” in Proceedings of the 5th International Joint Conference on Artificial Intelligence (IJCAI '77), pp. 598–606, 1977.
  23. C. Bessière, Handbook of Constraint Programming, Elsevier, 2006.
  24. T. Mantere and J. Koljonen, “Sudoku research page,” 2008, http://lipas.uwasa.fi/~timan/sudoku/.
  25. B. Crawford, R. Soto, E. Monfroy, W. Palma, C. Castro, and F. Paredes, “Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization,” Expert Systems with Applications, vol. 40, no. 5, pp. 1690–1695, 2013. View at Google Scholar
  26. E. Monfroy, C. Castro, B. Crawford, R. Soto, F. Paredes, and C. Figueroa, “A reactive and hybrid constraint solver,” Journal of Experimental and Theoretical Artificial Intelligence, vol. 25, no. 1, pp. 1–22, 2013. View at Google Scholar
  27. R. Soto, B. Crawford, E. Monfroy, and V. Bustos, “Using autonomous search for generating good enumeration strategy blends in constraint programming,” in Proceedings of the 12th International Conference on Computational Science and Its Applications (ICCSA '12), vol. 7335 of Lecture Notes in Computer Science, pp. 607–617, Springer, Berlin, Germany, 2012. View at Google Scholar
  28. B. Crawford, R. Soto, C. Castro, and E. Monfroy, “Extensible cp-based autonomous search,” in Proceedings of the HCI International, vol. 173 of Communications in Computer and Information Science, pp. 561–565, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar