Description
In chess, there is a piece called the "queen," which can move freely in any direction—vertically, horizontally, or diagonally.
In the N-1 Queens problem, you are given an N×(N-1) board and the goal is to place N queens on it. In this case, some queens will be able to attack each other vertically, horizontally, or diagonally. However, the key point is that the distance between the rows of attacking queens should be as large as possible. The greater the distance, the better the configuration.
For example, if N is 4, you need to place 4 queens on a 4×3 board, aiming to maximize the distance between the rows of any queens that can attack each other. As N increases, finding the optimal configuration becomes more challenging, and solving this is the main objective of the problem.