Almost all k-colorable graphs are easy to color
Journal of Algorithms
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Graph Coloring with Adaptive Evolutionary Algorithms
Journal of Heuristics
Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
The Phase-Transition Niche for Evolutionary Algorithms in Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
The symbiotic relationship between constraint programming and stochastic search: the Sudoku case
MATH'07 Proceedings of the 11th WSEAS International Conference on Applied Mathematics
Computers and Operations Research
On the combination of constraint programming and stochastic search: the Sudoku case
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
Sudoku using parallel simulated annealing
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Solving single-digit sudoku subproblems
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Parallelization of genetic operations that takes building-block linkage into account
Artificial Life and Robotics
A hybrid AC3-tabu search algorithm for solving Sudoku puzzles
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as `sudoku'. We see that this stochastic search-based algorithm, which uses simulated annealing, is able to complete logic-solvable puzzle-instances that feature daily in many of the UK's national newspapers. We also introduce a new method for producing sudoku problem instances (that are not necessarily logic-solvable) and use this together with the proposed SA algorithm to try and discover for what types of instances this algorithm is best suited. Consequently we notice the presence of an `easy-hard-easy' style phase-transition similar to other problems encountered in operational research.