@inproceedings{becker2018improving,
	abstract = {In this work we improve previous approaches based on genetic algorithms (GA) to solve sudoku puzzles. Those approaches use random swap mutations and filtered mutations, where both operations result in relatively slow convergence, the latter suffering a bit less. We suggest to improve GA based approaches by an intermediate local optimization step of the population. Compared to the previous approaches our approach is superior in terms of convergence rate, success rate and speed. As consequence we find the optimum with one population member and within one generation in a few milliseconds instead of nearly one minute.},
	title = {Improving an Evolutionary Approach to Sudoku Puzzles by Intermediate Optimization of the Population},
	author = {Becker, Matthias and Balci, Sinan},
	booktitle = {International Conference on Information Science and Applications},
	doi = {10.1007/978-981-13-1056-0_38},
	year = {2018},
	papertype = {fullpaper}
}