Skip to content

adampre/N-Queens-Puzzle

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 

Repository files navigation

N Queens Puzzle

Explanation: This puzzle is the problem of placing N chess queens on an N x N board, such that no two queens attack each other. For example, in a common 8 x 8 chess board with 8 queens, there are a total of 92 solutions.

Using coding and programming, you have to figure out the amount of possible configurations of all N queens that satisfy the condition above.

Wikipedia Article: https://en.wikipedia.org/wiki/Eight_queens_puzzle#:~:text=The%20eight%20queens%20puzzle%20is,in%20the%20mid%2D19th%20century

About

Solution to N Queens Puzzle with GUI.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages