Solving Sudoku with the GAuGE system

12Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Nicolau, M., & Ryan, C. (2006). Solving Sudoku with the GAuGE system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3905 LNCS, pp. 213–224). https://doi.org/10.1007/11729976_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free