This project solves the N-Queens problem using the efficient Min-Conflicts algorithm, capable of handling large board sizes like 5000x5000. It iteratively minimizes conflicts through heuristic optimization, ensuring rapid convergence to a valid solution.
-
Notifications
You must be signed in to change notification settings - Fork 0
This project solves the N-Queens problem using the efficient Min-Conflicts algorithm, capable of handling large board sizes like 5000x5000. It iteratively minimizes conflicts through heuristic optimization, ensuring rapid convergence to a valid solution.
TamiTo13/NQueens-Problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project solves the N-Queens problem using the efficient Min-Conflicts algorithm, capable of handling large board sizes like 5000x5000. It iteratively minimizes conflicts through heuristic optimization, ensuring rapid convergence to a valid solution.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published