# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## N Queens Problem Multiple choice Questions and Answers (MCQs)

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

In how many directions do queens attack each other?

1 | |

2 | |

3 | |

4 |

Question 1 Explanation:

Queens attack each other in three directions- vertical, horizontal and diagonal.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Placing n-queens so that no two queens attack each other is called?

n-queen's problem | |

8-queen's problem | |

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.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Where is the n-queens problem implemented?

carom | |

chess | |

ludo | |

cards |

Question 3 Explanation:

N-queens problem occurs in chess. It is the problem of placing n- queens in a n*n chess board.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Not more than 2 queens can occur in an n-queens problem.

true | |

false |

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.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

In n-queen problem, how many values of n does not provide an optimal solution?

1 | |

2 | |

3 | |

4 |

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.