#### Filter Results:

#### Publication Year

2013

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

- Ricardo Soto, Broderick Crawford, Felipe Mella, Javier Flores, Cristian Galleguillos, Sanjay Misra +2 others
- ICCSA
- 2015

- ‹
- 1
- ›