Solving N-queens
The N-queens problem is ideally suited to constraint programming. This is a short C++ program that solves N-queens for any value of N.
It uses two approaches along with A * algorithm.
- Minimum Conflicts
- Hii Climbing
Our constraints will be:
- No two queens should be on same row or column.
- Each row and column should contain only one queen.