N-Queen Problem Solver - with GA

"N-Queen Problem Solver - with GA" is Released.
http://en.wikipedia.org/wiki/Eight_queens_puzzle
You can find this problem's answer with other algorithms, but genetic algorithm is also works so good.
We don't have to check vertical and horizontal conflict, because of data structure of population(implicitly preclude conflict).
I made one population: not n*n array of 0~1, n vector of 0~n-1. And it does not overlap each other, so we don't have to check vertically and horizontally.
So we do check just diagonally, and computation time is very fast.