This is a n-queen problem solver using local search algorithms.
[Pt-Br]: Este é um programa que resolve o problema das n-rainhas utilizando algoritmos de busca local.
- Hill Climbing
- Hill Climbing with random restart
- Simulated Annealing
To solve this problem we used as a heuristic the number of pairs of queens attacking each other, either directly or indirectly.
[Pt-Br]: Para resolver este problema utilizou-se como heurística, o número de pares de rainhas se atacando, seja direta ou indiretamente.
python main.py -h
usage: main.py [-h] [-n N] [-i I] [--all {0,1}]
N-queens problem solver by using local search algorithms. Author: Vitor Veras.
Default arguments: -n=8 ; -i=10 ; --all=0
optional arguments:
-h, --help show this help message and exit
-n N Size of the board
-i I Number of iterations
--all {0,1} 0 = show one solution | 1 = show all solutionspython main.py
python main.py
hill_climbing
- Hit rate: 2/10 Runtime: 0.038855
. . . . . Q . .
. Q . . . . . .
. . . . . . Q .
Q . . . . . . .
. . Q . . . . .
. . . . Q . . .
. . . . . . . Q
. . . Q . . . .
hc_random_restart
- Hit rate: 9/10 Runtime: 0.196223
. . . . . . Q .
. Q . . . . . .
. . . Q . . . .
Q . . . . . . .
. . . . . . . Q
. . . . Q . . .
. . Q . . . . .
. . . . . Q . .
simulated_annealing
- Hit rate: 10/10 Runtime: 0.779093
. . . Q . . . .
. . . . . . Q .
. . Q . . . . .
. . . . . . . Q
. Q . . . . . .
. . . . Q . . .
Q . . . . . . .
. . . . . Q . .
- Vitor Veras de Moura - GitHub - Email: [email protected]
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent