現在この提出コンテンツをフォロー中です。
- フォローしているコンテンツ フィードに更新が表示されます。
- コミュニケーション基本設定に応じて電子メールを受け取ることができます
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.
引用
Swapnil Marathe (2026). Genetic Algorithm for n-queen problem (https://jp.mathworks.com/matlabcentral/fileexchange/35820-genetic-algorithm-for-n-queen-problem), MATLAB Central File Exchange. に取得済み.
謝辞
ヒントを得たファイル: Travelling salesman problem with Genetic algorithm
