Ponencia
A Cellular Sudoku Solver
Autor/es | Díaz Pernil, Daniel
Fernández Márquez, Carlos M. García Quismondo, Manuel Gutiérrez Naranjo, Miguel Ángel Pérez Jiménez, Mario de Jesús |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2010 |
Fecha de depósito | 2016-03-28 |
Publicado en |
|
ISBN/ISSN | 9788461423576 |
Resumen | Sudoku is a very popular puzzle which consists on placing several numbers in
a squared grid according to some simple rules. In this paper we present an efficient family
of P systems which solve sudoku puzzles of any order ... Sudoku is a very popular puzzle which consists on placing several numbers in a squared grid according to some simple rules. In this paper we present an efficient family of P systems which solve sudoku puzzles of any order verifying a specific property. The solution is searched by using a simple human-style method. If the sudoku cannot be solved by using this strategy, the P system detects this drawback and then the computations stops and returns No. Otherwise, the P system encodes the solution and returns Yes in the last computation step. |
Identificador del proyecto | TIN2008-04487-E
TIN-2009-13192 P08-TIC-04200 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
06sudokuMiguel.pdf | 170.9Kb | [PDF] | Ver/ | |