Solution for the N-Queens puzzle using recursive backtracking implemented in Go
4x4 board example:
nqueens$ go build && ./nqueens 4
[. . Q .]
[Q . . .]
[. . . Q]
[. Q . .]
[. Q . .]
[. . . Q]
[Q . . .]
[. . Q .]-
Notifications
You must be signed in to change notification settings - Fork 0
zianwar/nqueens
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Solution for the N-Queen problem
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published