A fairly simple SuduKu-Solver written in Java, which I had finished with my teammate off and on for a week.
##How to run
just Download ZIP and import it into your eclipse IDE.Compile and Click Run. Done.
Read data
It expects a partially solved Sudoku board. It has written already.(One thing we may want to develop is to create a Graphic UI;)
#Problem Solving
A genetic algorithm is a general way to solve optimization problems. The basic algorithm is very simple:
- Create a population (vector) of random solutions (represented in a problem specific way, but often a vector of floats or ints)
- Do Evolution until the answer we want exist, which means we should pick a few parent to generate next generation.until next generation’s population is large enough.
- Replace the old generation with a new generation, which is either a copy of the best solution, a mutation (perturbation) of the best solution, an entirely new randomized solution or a cross between the two best solutions. These are the most common evolutionary operators, but you could dream up others that use information from existing solutions to create new potentially good solutions.
- Check if you have a new global best fitness, if so, store the solution.
- Go to 2
###warning If too many iterations go by without improvement, the entire population might be stuck in a local minimum (at the bottom of a local valley, with a possible chasm somewhere else, so to speak). If so, kill everyone and start over at 1.
###More details Reference Link: