Embedded Files
Due-date : to be announced "Read before submission"
Input: size n
Input: size n
Output: All solutions to the n-Queen problem (where the n queens in the nxn board would not attack each other)
Output: All solutions to the n-Queen problem (where the n queens in the nxn board would not attack each other)
Hint: Enumeration; Try-&-Error; Generating all possible queens' moves, removing illegal outcomes and keeping feasible solutions
input: n = 6
output: 4 solutions to the 4-Queen problem
(1) Each solution is represented as an 1D array where s[i]=j denotes "one Queen locates at position [i, j]"
(2) Each solution is represented as a 2D array where q[i, j]="Q" iff "one Queen locates at position [i, j]"
(3) Each solution is represented as a 2D StringGrid array
input: n = 7; output: 40 solutions to the 7-Queen problem
(1) Each solution is represented as an 1D array where s[i]=j denotes "one Queen locates at position [i, j]"
(2) Each solution is represented as a 2D array where q[i, j]="Q" iff "one Queen locates at position [i, j]"
(3) Each solution is represented as a 2D StringGrid array
Corresponding output for input: n = 7, 6, 5, 4, 3, 2
Google Sites
Report abuse