A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Genetic Algorithms Using Grammatical Evolution
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
The behavior of adaptive systems which employ genetic and correlation algorithms
The behavior of adaptive systems which employ genetic and correlation algorithms
Nonlinearities in genetic adaptive search.
Nonlinearities in genetic adaptive search.
How functional dependency adapts to salience hierarchy in the GAuGE system
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
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
Hi-index | 0.00 |
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.