Opened Access A Cellular Sudoku Solver
Estadísticas
Icon
Exportar a
Autor: 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: 2010
Publicado en: Proceedings of the Eighth Brainstorming Week on Membrane Computing, 77-88. Sevilla, E.T.S. de Ingeniería Informática, 1-5 de Febrero, 2010
ISBN/ISSN: 9788461423576
Tipo de documento: Ponencia
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 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.
Tamaño: 170.9Kb
Formato: PDF

URI: http://hdl.handle.net/11441/38996

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones