n-Queens Problem has complexity O(n^2)
The solution for n = 1000 can be found in about 2-10 seconds
The solution for n = 2000 can be found in about 20-60 seconds
-
Notifications
You must be signed in to change notification settings - Fork 0
hientominh/heuristic-n-queens
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
n-Queens Problem has complexity O(n^2)
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published