Implementation of an algorithm to posicionate n queens in a chess board of size n x n, with the queens not being affected by each other.
The project uses a Constraint Satisfaction Problem Approach.
- The problem only have solution for n >= 4.
- Initially, the board is empty.
You can access the application clicking here.