The N-Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. This means that no two Queens should be in the same row or column or diameter.
In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection.
In this problem, we want to solve the n queen problem with the help of genetic algorithm.
- Insert
- Scramble
- Inversion
- Swap
- Roulette wheel
- Ranking
- PMX
- Order
- Genitor
- m + n
| PopSize | Parent selection | Crossover | Mutation | Survivor selection | Result |
|---|---|---|---|---|---|
| 150 | Roulette | PMX | Inversion | Genitor | 3 ith |
| 50 | Ranking | Order | Swap | m + n | 6 ith |
| PopSize | Parent selection | Crossover | Mutation | Survivor selection | Result |
|---|---|---|---|---|---|
| 1000 | Roulette | PMX | Inversion | Genitor | 176 ith |
| 700 | Ranking | PMX | Swap | Genitor | 1 ith |
| 150 | Ranking | Order | Scramble | m + n | 73 ith |
| 500 | Ranking | Order | Insert | m + n | 5 ith |
| PopSize | Parent selection | Crossover | Mutation | Survivor selection | Result |
|---|---|---|---|---|---|
| 5000 | Roulette | PMX | Insert | Genitor | 457 ith (299/300) |
| 5000 | Roulette | PMX | Scramble | Genitor | 631 ith (298/300) |
| 1000 | Roulette | Order | Scramble | Genitor | 182 ith (298/300) |
| 1000 | Ranking | Order | Inversion | m + n | 3 ith (297/300) |
| 1000 | Ranking | PMX | Swap | Genitor | 8 ith (296/300) |
Contact me @:
e-mail:
Telegram id: