Genetic Algorithm for n-queen problem

N-queen generalized genetic algorithm. Parameters can be changed and tested

現在この提出コンテンツをフォロー中です。

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

カテゴリ

Help Center および MATLAB AnswersGenetic Algorithm についてさらに検索

一般的な情報

MATLAB リリースの互換性

  • すべてのリリースと互換性あり

プラットフォームの互換性

  • Windows
  • macOS
  • Linux
バージョン 公開済み リリース ノート Action
1.3.0.0

Modified the file to calculate the fitness function for 'n' queens and not 8 queens

1.1.0.0

description of how the each individual has been defined

1.0.0.0