Genetic Algorithms with Local Optima Handling to Solve Sudoku Puzzles

  title={Genetic Algorithms with Local Optima Handling to Solve Sudoku Puzzles},
  author={Firas Gerges and Germain Zouein and Danielle Azar},
  booktitle={International Conference on Computing and Artificial Intelligence},
Sudoku is a popular combinatorial number puzzle game and is widely spread on online blogs and in newspapers worldwide. However, the game is very complex in nature and solving it gives rise to an NP-Complete problem. In this paper, we introduce a heuristic to tackle the problem. The heuristic is a genetic algorithm with modified crossover and mutation operators. In addition, we present a new approach to prevent the genetic algorithm from getting stuck in local optima. We refer to this approach… 

Figures and Tables from this paper

An Empirical Analysis of Genetic Algorithm with Different Mutation and Crossover Operators for Solving Sudoku

The findings reveal that GA is ineffective to deal with the Sudoku problem, as compared to other classical algorithms, as it often fails to disengage itself from some local optimum condition.

Early Prediction of Movie Success Using Machine Learning and Evolutionary Computation

An evolutionary approach, based on Genetic Algorithms (GA), is proposed for optimizing the outputs of the decision tree algorithm (C5) used for the prediction of movie success during the early stage of production, achieving a prediction accuracy of 90.5%.


The tuning of deep neural network learning (DNN) hyper-parameters is explored using an evolutionary based approach popularized for use in estimating solutions to problems where the problem space is too large to get an exact solution.

Lean Six Sigma and Design of Experiments: An Empirical Case Study From the Dairy Industry

  • Joel T. Nader
  • Business
    2022 Interdisciplinary Research in Technology and Management (IRTM)
  • 2022
In today's highly competitive business environments, fast-paced, flexible and dynamic strategies are adopted to preserve sustainability that remains the center of attention of all organizations. To

Correction of the stress–strain curve for 2024 aluminum alloy after necking using the new surface strain method

Nowadays, many studies concerning plasticity and numerical simulations indicate that the true stress–strain curve plays a prominent role in the analysis of metal deformation. Hence, a new method is

Hyper-Parameter Tuning in Deep Neural Network Learning

  • Tiffany Zhan
  • Computer Science
    Artificial Intelligence and Applications
  • 2022
The tuning of deep neural network learning (DNN) hyper-parameters is explored using an evolutionary based approach popularized for use in estimating solutions to problems where the problem space is too large to get an exact solution.

A multi-energy load prediction of a building using the multi-layer perceptron neural network method with different optimization algorithms

The obtained results emphasize the remarkable performance of adaptive chaotic grey wolf optimization, which can be used to train the multi-layer perceptron neural network and forecast the buildings’ energy consumption with the highest accuracy.

Advanced Analytics Tools for Process Improvement: A Case Study in a Brewery

  • Joel T. Nader
  • Business
    2022 Interdisciplinary Research in Technology and Management (IRTM)
  • 2022
The fourth industrial revolution (Industry 4.0) and the digital transformation are rising exponentially nowadays. This digital revolution is mainly manifested by incorporation of different



Solving and Rating Sudoku Puzzles with Genetic Algorithms

If genetic algorithm optimization is an efficient method for solving Sudoku puzzles and to generate new puzzles is tested to find out if the puzzles, that are difficult for human solver, are also difficult for the genetic algorithms.

A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles

A new way of applying GA to this problem which uses more-informed chromosomes than other works in the literature is proposed, and the parameters of the GA are optimized using puzzles with different levels of difficulty.

Solving Sudoku Puzzles Using Improved Artificial Bee Colony Algorithm

This paper explores the possibility of using an improved variant of the Artificial Bee Colony algorithm in solving Sudoku puzzles and results obtained support the conclusion that the algorithm can be used to solve Sudoku Puzzles efficiently and effectively.

Solving Sudoku Puzzles with Genetic Algorithm

The genetic algorithm developed attempts to use a simple fitness function which checks whether numbers are repeated in rows and columns, but it was unable to solve any of the more difficult puzzles.

Improved ant colony genetic algorithm hybrid for Sudoku solving

  • Timo Mantere
  • Computer Science
    2013 Third World Congress on Information and Communication Technologies (WICT 2013)
  • 2013
The new improved version of ant colony optimization/genetic algorithm hybrid for Sudoku puzzle solving and new ideas for populations sorting and elitism rules in order to improve the earlier evolutionary algorithm based Sudoku solvers are presented.

Harmony Search Algorithm for Solving Sudoku

HS could successfully solve the optimization problem after 285 function evaluations, taking 9 seconds, and sensitivity analysis of HS parameters was performed to obtain a better idea of algorithm parameter values.

Solving Sudoku with genetic operations that preserve building blocks

  • Yuji SatoHazuki Inoue
  • Physics
    Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games
  • 2010
Evaluation of the proposed techniques using commercial Sudoku puzzle sets and three puzzles ranked as super difficult compared with previously reported examples show that the rate of optimum solutions can be greatly improved.

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles

This paper proposes a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world, known to be efficient for domain filtering in the presence of constraints that must be pairwise different.

Recursive Backtracking for Solving 9*9 Sudoku Puzzle

It is explained possible number of valid grids in a 9*9 sudoku and a programming approach for solving a 9-9 suDoku puzzle is developed and the results have been analysed in accordance with various number of clues.