N Queens Problem Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
In how many directions do queens attack each other?
Question 1 Explanation:
Queens attack each other in three directions- vertical, horizontal and diagonal.
Placing n-queens so that no two queens attack each other is called?
Hamiltonian circuit problem
subset sum problem
Question 2 Explanation:
Placing n queens so that no two queens attack each other is n-queens problem. If n=8, it is called as 8-queens problem.
Where is the n-queens problem implemented?
Question 3 Explanation:
N-queens problem occurs in chess. It is the problem of placing n- queens in a n*n chess board.
Not more than 2 queens can occur in an n-queens problem.
Question 4 Explanation:
Unlike a real chess game, n-queens occur in a n-queen problem since it is the problem of dealing with n-queens.
In n-queen problem, how many values of n does not provide an optimal solution?
Question 5 Explanation:
N-queen problem does not provide an optimal solution of only three values of n (i.e.) n=2, 3.
There are 5 questions to complete.