👑 N-Queens Puzzle Solver in C

This project implements a recursive backtracking solution to the classic N-Queens problem. It finds valid configurations where N queens can be placed on an N×N chessboard such that none attack each other.

🔧 Features

• Solves the N-Queens puzzle using recursion and backtracking.
• Prints the board with queen positions.
• Written in C for educational purposes.

🚀 How to Run

1. Clone the repository:

git clone https://github.com/Asaf-Alber/Queen-Puzzle.git
cd Queen-Puzzle

2. Compile the code:

gcc queens.c -o queens

3. Run the program:

./queens

🧪 Example Output

Q . . . . . . .
. . . . Q . . .
. . . . . . Q .
. . . Q . . . .
. . . . . Q . .
. Q . . . . . .
. . . . . . . Q
. . Q . . . . .

👨‍💻 Author

Created by Asaf Alber

📄 License

This project is licensed under the MIT License.