Skip to content

Latest commit

 

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 

Repository files navigation

# Eight Queens Problem A classic backtracking algorithm to place 8 queens on a chessboard such that no two queens attack each other. ## Problem Description Place 8 queens on an 8×8 chessboard so that no two queens can attack each other (no two queens share the same row, column, or diagonal). ## Solution Implements backtracking algorithm to find all possible solutions.

About

Resources

Stars

44 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors