Skip to content

Latest commit

 

History

1 Commit

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 

Repository files navigation

8 Queens Problem

Place 8 queens in such a manner on an 8 x 8 chessboard that no queens attack each other by being in the same row, column or diagonal

Solution

I have solved the 8 Queens Problem using Python implementing a backtracking algorithm. 8QueensProblem.py contains the implementation of this solution.

Video Demonstration

Video Thumbnail

Click on the thumbnail above to watch the video demonstration of the solution to the 8 Queens Problem.

Usage

You can run the 8QueensProblem.py script to see the solution in action. Additionally, you can refer to the video and the picture for further understanding and visualization of the solution.

About

The 8 Queens Problem is placing of eight queens on an 8 x 8 chessboard in a way that no two queens threaten each other. This project presents a solution to through Python implementation utilizing a backtracking algorithm.

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages