이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
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://kr.mathworks.com/matlabcentral/fileexchange/35820-genetic-algorithm-for-n-queen-problem), MATLAB Central File Exchange. 검색 날짜: .
도움
도움 받은 파일: Travelling salesman problem with Genetic algorithm
