Solving sudoku with the GAuGE system

  • Authors:
  • Miguel Nicolau;Conor Ryan

  • Affiliations:
  • Biocomputing and Developmental Systems Group, Department of Computer Science and Information Systems, University of Limerick, Ireland;Biocomputing and Developmental Systems Group, Department of Computer Science and Information Systems, University of Limerick, Ireland

  • Venue:
  • EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
  • Year:
  • 2006
  • Harmony search algorithm for solving Sudoku

    KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I

Quantified Score

Hi-index 0.00

Visualization

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.