Attempt to find a solution to an N queen problem using either the minimal-conflict heuristic, or backtraking.
Build: 'javac *.java'
Run: 'java NQueens <n>', where n is the number of queens to place, or 'java NQueens2 <n>'.
-
Notifications
You must be signed in to change notification settings - Fork 0
unreasonableman/n-queens
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published