- #1
discoverer02
- 138
- 1
I have an assignment to write a recursive function that will safely place n Queens on an n x n chessboard. This wasn't all that difficult to figure out.
For extra credit I'm supposed to write another function(s) (recursive?) that figures out all the possible solutions. This is, so far, giving me fits.
Any nudge in the right direction would be greatly appreciated.
For extra credit I'm supposed to write another function(s) (recursive?) that figures out all the possible solutions. This is, so far, giving me fits.
Any nudge in the right direction would be greatly appreciated.
Last edited: