Solving Sudoku with the GAuGE System

Files in This Item:
File Description SizeFormat 
sudoku.pdf294.93 kBAdobe PDFDownload
Title: Solving Sudoku with the GAuGE System
Authors: Nicolau, Miguel
Ryan, Conor
Permanent link: http://hdl.handle.net/10197/8325
Date: 12-Apr-2006
Abstract: This paper presents an evolutionary approach to solving Sudoku puzzles. Sudoku is an interesting problem because it is a challenging logical puzzle that has previously only been solved by computers using various brute force methods, but it is also an abstract form of a timetabling problem, and is scalably difficult. A different take on the problem, motivated by the desire to be able to generalise it, is presented. The GAuGE system was applied to the problem, and the results obtained show that its mapping process is well suited for this class of problems.
Type of material: Conference Publication
Publisher: Springer
Copyright (published version): 2006 Springer
Keywords: Genetic algorithmsGrammatical evolution
DOI: 10.1007/11729976_19
Language: en
Status of Item: Peer reviewed
Is part of: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., and Ekart, Aniko (eds.). Proceedings 9th European Conference Genetic Programming (EuroGP 2006) (Volume 3905)
Conference Details: 9th European Conference Genetic Programming (EuroGP 2006), Budapest, Hungary, 10-12 April 2006
Appears in Collections:Business Research Collection

Show full item record

SCOPUSTM   
Citations 50

6
Last Week
1
Last month
checked on Aug 18, 2018

Download(s) 50

42
checked on May 25, 2018

Google ScholarTM

Check

Altmetric


This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.