Question discussion

The 6-queens problem asks for the number of ways to place 6 queens on a 6 × 6 chessboard so that no two queens attack each other. How many…

2369Medium DSSSB TGT Computer Science 0 replies 1 views

The 6-queens problem asks for the number of ways to place 6 queens on a 6 × 6 chessboard so that no two queens attack each other. How many distinct solutions exist?

Correct answer: C

Explanation

Exhaustive back-tracking over the 6 × 6 board gives exactly 4 solutions (the counts for n = 4 and n = 5 are 2 and 10).

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!