You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This project implements a Constraint Satisfaction Problem (CSP) solution for the N-Queens problem on an n x n chessboard. The goal is to place n queens on the board such that no two queens attack each other.