Solving nonograms using genetic algorithms

摘要

This paper presents the possibilities of using classical genetic algorithm as a tool for solving logical images. Results are presented for simple objective function taking into account the quantity of 0's and 1's and the modified objective function basing on the differences in length of each filled block. Brute-force algorithm was used to illustrate the complexity of NP-complete problem.