N Queens Problem

In chess, there is a piece called the "queen," which can move freely in any direction—vertically, horizontally, or diagonally.

In the N-Queens problem, you are given an N×N board, and the goal is to place N queens on it. The key point is that no queen should be able to attack another. A queen can attack another if they are in the same row, column, or diagonal.

For example, if N is 4, you need to place 4 queens on a 4×4 board in such a way that no queen can attack another. As N increases, finding a solution becomes more difficult, and figuring out how to do this is the challenge of the problem.