Skip to content

The n-queens puzzle is the problem of placing n chess queens on an n×n chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. For e.g. For n = 4, There are 2 solutions.

Notifications You must be signed in to change notification settings

adarsh-shahi/n-queens

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

About

The n-queens puzzle is the problem of placing n chess queens on an n×n chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. For e.g. For n = 4, There are 2 solutions.

Topics

Stars

Watchers

Forks

Releases

No releases published

Sponsor this project

Packages

No packages published