Opened Access A Cellular Sudoku Solver
Cites
Show item statistics
Icon
Export to
Author: 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
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2010
Published in: 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
Document type: Presentation
Abstract: 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.
Size: 170.9Kb
Format: PDF

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

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)