Solving and analyzing Sudokus with cultural algorithms

Mantere, Timo; Koljonen, Janne

doi:10.1109/cec.2008.4631350

Cited by 28 publications

(18 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The tested problems are classified in diverse kinds of complexity, including the AI Escargot which is considered the most difficult instance [14]. A useful difficulty classification including easy, medium, and hard Sudoku instances has been proposed in [2], [3], [15], and re-classified in groups [9]. All instances have unique solution.…”

Section: Resultsmentioning

confidence: 99%

A Marriage Theorem Based-Algorithm for Solving Sudoku

Soto

Crawford

Galleguillos

et al. 2015

2015 Fourteenth Mexican International Conference on Artificial Intelligence (MICAI)

View full text Add to dashboard Cite

Millions of people around the world are solving a complex constraint satisfaction problem although they do not know. This problem is a famous game known as Sudoku puzzle and it consists in filling a n 2 × n 2 grid, composed by n columns, n rows and n sub-grids; each one containing different digits from 1 to n 2 . In this paper, we propose an exact algorithm based on Hall's marriage theorem in order to solve it. After applied our proposed method, we have noticed that some instances with particular features are possible to solve. The algorithm is quite simple to code it and good results are reached solving some instances. The unresolved ones as result of the application of the algorithm is generated an equivalent problem to the original one, but more easiest to solve. We illustrate the experimental evaluation comparing with another complete methods.

show abstract

Section: Resultsmentioning

confidence: 99%

A Marriage Theorem Based-Algorithm for Solving Sudoku

Soto

Crawford

Galleguillos

et al. 2015

2015 Fourteenth Mexican International Conference on Artificial Intelligence (MICAI)

View full text Add to dashboard Cite

show abstract

“…That is to say, checking the scores for each of the three rows that constitute a sub-block and passing the those of the highest score on to the child reduces the probability of a high score BB being reduced to a low score BB by hitchhiking. We can also expect less destruction of BB that comprises cell rows or columns than occurs with the crossover method used in the conventional example [1,2,4].…”

Section: Methods For Dearing With the Building Block Problemmentioning

confidence: 93%

Genetic operations to solve sudoku puzzles

Sato

Inoue

2010

Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

show abstract

“…The advantages of these types of penalties have been confirmed in several variants of EAs [36], [23].…”

mentioning

confidence: 96%

The importance of the individual encoding in memetic algorithms with diversity control applied to large Sudoku puzzles

Segura

Segredo

Miranda

2017

2017 IEEE Congress on Evolutionary Computation (CEC)

View full text Add to dashboard Cite

Abstract-In recent years, several memetic algorithms with explicit mechanisms to delay convergence have shown great promise when solving 9x9 Sudoku puzzles. This paper analyzes and extends state-of-the-art schemes for dealing with Sudoku puzzles of larger dimensionality. Two interesting aspects are analyzed: the importance of the encoding and its relation with the way of managing the diversity. Specifically, three different ways of encoding the individuals and six different methods, including four that control the diversity in a special way, are studied. Computational results are shown with twenty 16x16 Sudoku puzzles. Contrary to the low-dimensional case, important differences appear among the several ways of controlling diversity. Specifically, a method that incorporates multi-objective concepts in the replacement phase to deal with the diversity, resulted in the most promising method. Results show that both the encoding and the way of managing diversity are crucial to attain high success probabilities in large Sudoku puzzles. They also show that, while the analyzed encodings induce different search space sizes, this feature is not enough to justify the differences in the performance attained by them.

show abstract

Solving and analyzing Sudokus with cultural algorithms

Cited by 28 publications

References 9 publications

A Marriage Theorem Based-Algorithm for Solving Sudoku

A Marriage Theorem Based-Algorithm for Solving Sudoku

Genetic operations to solve sudoku puzzles

The importance of the individual encoding in memetic algorithms with diversity control applied to large Sudoku puzzles

Contact Info

Product

Resources

About