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.
Citation pour cette source
Swapnil Marathe (2024). Genetic Algorithm for n-queen problem (https://www.mathworks.com/matlabcentral/fileexchange/35820-genetic-algorithm-for-n-queen-problem), MATLAB Central File Exchange. Récupéré le .
Compatibilité avec les versions de MATLAB
Plateformes compatibles
Windows macOS LinuxCatégories
Tags
Remerciements
Inspiré par : Travelling salesman problem with Genetic algorithm
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
Version | Publié le | Notes de version | |
---|---|---|---|
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 |