Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 20
What does the backtracking solution to N-Queens rely on to prune?
A
Greedy placement
B
Trying all n^n placements
C
Sorting rows
D
Placing queens row by row and tracking used columns and diagonals in sets/bitmasks, abandoning conflicting partial placements