Skip to content

ajmalali/nqueens-solver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

What is the N-queens problem?

The N-queens is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.

Here we can see that none of the 4 queens are on the same row, column, or diagonal.

About

Solving the N-Queens problem by Backtracking with Forward Checking (FC) and Minimum Remaining Value (MRV)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages