Python3 solution for N-Queens using backtracking with and without forward checking. My laptop gives solutions for N = 18 in ~100 seconds without forward checking, ~70 seconds with.
-
Notifications
You must be signed in to change notification settings - Fork 0
Python solution for N-Queens using backtracking with and without forward checking
License
BluedragonXVI/N-Queens
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Python solution for N-Queens using backtracking with and without forward checking
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published