Genetic Algorithm for n-queen problem

EACH INDIVIDUAL:- [1*8] where each column value tells the position of queen in that particular column

FINAL SOLUTION:- each row gives one unique solution in the 'solution' matrix

It has very basic but effective functions of selection,crossover and mutation.
Queens are randomly positioned in the beginning.
I have written it for n-queens.
It gives a good amount of solutions for queens > 8.
Also you can change parameters and test for yourself.
The cross-over logic is given in the attached PDF-cross-over_logic.