<Dl> <Dd> Place nine queens and one pawn on an 8 × 8 board in such a way that queens don't attack each other . Further generalization of the problem (complete solution is currently unknown): given an n × n chess board and m> n queens, find the minimum number of pawns, so that the m queens and the pawns can be set up on the board in such a way that no two queens attack each other . </Dd> </Dl> <Dd> Place nine queens and one pawn on an 8 × 8 board in such a way that queens don't attack each other . Further generalization of the problem (complete solution is currently unknown): given an n × n chess board and m> n queens, find the minimum number of pawns, so that the m queens and the pawns can be set up on the board in such a way that no two queens attack each other . </Dd> <Ul> <Li> Queens and knights problem </Li> </Ul> <Li> Queens and knights problem </Li>

Which type of algorithm is used to solve 8 queen problem