A solution to the 8 Queens Problem using basic Python. The eight queens problem is the problem of placing eight queens on an 8×8 chessboard such that none of them attack one another (no two are in the same row, column, or diagonal). More generally, the n queens problem places n queens on an n×n chessboard.
-
Notifications
You must be signed in to change notification settings - Fork 0
UpLong23/8_Queens_Problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A solution to the 8_Queens_Problem using basic Python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published