This code of matlab originally solved the problem for 8 queens in a 8 by 8 chessboard without checking each other, solved with a genetic algorithm. Extended for a n by n cheassboard with m number of queens in exponential time. Not a solution of the P=NP problem.
-
Notifications
You must be signed in to change notification settings - Fork 0
This code of matlab originally solved the problem for 8 queens in a 8 by 8 chessboard without checking each other, solved with a genetic algorithm. Extended for a n by n cheassboard with m number of queens in exponential time. Not a solution of the P=NP problem.
fabianhr21/N-Queens
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This code of matlab originally solved the problem for 8 queens in a 8 by 8 chessboard without checking each other, solved with a genetic algorithm. Extended for a n by n cheassboard with m number of queens in exponential time. Not a solution of the P=NP problem.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published