The Sudoku problem consists in filling a n 2 Â n 2 grid so that each column, row and each one of the n Â n sub-grids contain different digits from 1 to n 2. This is a non-trivial problem, known to be NP-complete. The literature reports different incomplete search methods devoted to tackle this problem, genetic computing being the one exhibiting the best… (More)
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 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… (More)
The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n(2) × n(2) grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n(2). Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods… (More)
A nonogram corresponds to a puzzle game. The aim in this game is generating an image on a grid by checking certain cells, this cells have to satisfy some rules associated with each row and column. In this paper, genetic algorithms are used to solve this problem, applying certain improvements that will benefit the process of seeking solutions.
The aim of the Sudoku puzzle is filling with digits from 1 to 9 into each cell of a square matrix with 9 rows and 9 columns, divided into 9 3 × 3 regions, so that each column, row, and region contains have different values. This paper reports recent results for solving Sudokus achieved by combining metaheuristics and AC3 which is a filtering… (More)
Millions of people around the world are solving a complex constraint satisfaction problem although they do not know. This problem is a famous game known as Sudoku puzzle and it consists in filling a n<sup>2</sup> × n<sup>2</sup> grid, composed by n columns, n rows and n sub-grids, each one containing different digits from 1 to n<sup>2</sup>. In this… (More)