A Novel Assembly Evolutionary Algorithm for n-Queens Problem

Individuals in nowadays evolutionary algorithms for n-queens problem do not satisfy some basic constraint conditions. Motivated by self-assembly computing, a novel assembly evolutionary algorithm for n-queens problem is presented. Each individual is made up of assembly-parts, assembly-seeds and status information. Some important notions and rules regarding the novel assembly evolutionary algorithm are discussed. Experimental results show that the algorithm finds a solution faster than other latest evolutionary algorithms.