Geometric particle swarm optimization for the sudoku puzzle

Alberto Moraglio, Julian Togelius
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The aim of this paper is to demonstrate the applicability of GPSO to non-trivial combinatorial spaces. The Sudoku puzzle is a perfect candidate to test new algorithmic ideas because it is entertaining and instructive as well as a nontrivial constrained combinatorial problem. We apply GPSO to solve the sudoku puzzle.
doi:10.1145/1276958.1276975 dblp:conf/gecco/MoraglioT07 fatcat:z3ruhimm6bdqtlfx5ov76m35ma