| 3 Dec 2012 |
Helen Chen |
Problem Definition: In N-Queens Problem, an N N chess board and N Queens are given. The queens must be placed on the board in such a way that no two queens check each other.
Description: A chromosome is a permutation of the numbers 1 to N which denotes the board configuration. For instance, the solution represents a board where the n-th column contains exactly one queen placed in the -th row. Using such chromosome, we restrict the search to board configurations where horizontal constraint violations do not occur. Now the remaining is to minimize the diagonal constraint violation.
Fitness value for a correct solution in a board will be which actually represents that there is no check and in the extreme case when all queens are in diagonal fitness value will become zero.
|
|
