Question

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

(a) n-queen’s problem

(b) 8-queen’s problem

(c) Hamiltonian circuit problem

(d) subset sum problem

The question was posed to me in a job interview.

My question comes from Backtracking in portion Backtracking of Data Structures & Algorithms II

Answer 1

The correct option is (a) n-queen’s problem

Easiest 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.