# Continue reading Tags:

On September 12, 2020 by adminTag Archive: elitism.

A Nature Inspired Sudoku Solver.

Filed under:.

## Projects — Leave a comment December 25

2013 This project aims to the development of an open-source experimental prototype for solving and generating Sudoku puzzles by using only the strength of Genetic Algorithms.

This is not a general purpose GA framework but a specific GA implementation for solving and generating Sudoku puzzles.

The mechanics of the GA are based on the theoretical scientific paper “Solving and Rating Sudoku Puzzles with Genetic Algorithm s” of Timo Mantere and Janne Koljonen.

From the first moment, I liked the paper.

So, I implemented it in Python.

Also, I have add some variations to the algorithm in order to be more efficient .

This project can be used in order to solve or generate new NxN Sudoku puzzles with N sub-boxes (e.g.

4×4, 9×9, etc).

### Continue reading 39.074208 21.824312 Tags: crossover

elitism, , genetic, library, mutation, nature inspired, , puzzle, sudoku solver Read More & Comment Genetic Algorithm – Example 4.

Filed under:.

#### Projects — Leave a comment February 27

2011 I quote below a personal portable implementation (in C++) of a classic genetic algorithm (evolutionary algorithm) used to maximize the function f(x, y) = sin(x) * sin(y) in the domain 0 <= x, y <= 2pi.
You can compile the program with the g++ compiler.
Continue reading Tags: , crossover, elitism, , genetic, hill climbing, mutation, , , roulette wheel Read More & Comment Genetic Algorithm – Example 3.

Filed under: , Projects — Leave a comment I quote below a personal portable implementation (in C++) of a classic genetic algorithm ( evolutionary algorithm ) used to maximize the function f(x) = sin(x) in the domain 0 <= x <= 2pi.
You can compile the program with the g++ compiler.
Continue reading Tags: , crossover, elitism, , genetic, hill climbing, mutation, , , roulette wheel Read More & Comment Genetic Algorithm – Example 2.

Filed under:.

#### Projects — Leave a comment February 20

2011 I quote below a personal portable implementation (in C++) of a classic genetic algorithm (evolutionary algorithm) used to maximize the function f(x) = sin(x) in the domain 0 <= x <= 2pi.
You can compile the program with the g++ compiler.
Continue reading Tags: , crossover, elitism, , genetic, mutation, , , roulette wheel Read More & Comment Genetic Algorithm – Example 1.

Filed under: , Projects — Leave a comment I quote below a personal portable implementation (in C++) of a classic genetic algorithm (evolutionary algorithm) used to maximize the function f(x) = sin(x) in the domain 0 <= x <= 2pi.
You can compile the program with the g++ compiler.
Continue reading Tags: , crossover, elitism, , genetic, mutation, , , roulette wheel Read More & Comment.
(79).
(21).
(15).
(26).
(4).
(7).
(55).
(24).
(4).
(16).
(14).
(4).
(7).
(10).
(78).
(11).
(9).
(1).
September 2020 M T W T F S S 123456 78910111213 14151617181920 21222324252627 282930 « Oct.
(2).
(4).
(1).
(1).
(2).
(1).
(1).
(1).
(2).
(1).
(9).
(1).
(8).
(1).
(1).
(2).
(4).
(7).
(1).
(1).
(1).
(8).
(12).
(1).
(2).
(1).
(2).
(1).
(2).
(1).
(1).
(4).
(20).
(13).
(5).
(2).
(10).
(13).
(10).
(10).
(20).
287,005 hits.

## Leave a Reply