The **N-Queens Problem** is a classic puzzle in computer science and mathematics. The challenge is to place 8 queens on an 8x8 chessboard so that no two queens threaten each other. This means no two queens can share the same row, column, or diagonal.

This interactive visualizer demonstrates the **Backtracking Algorithm**. Watch how the computer tries to place queens row by row, and if it gets stuck, it "backtracks" (removes the last queen) and tries a different position.

Key Concepts:

• Backtracking: A trial-and-error method for solving constraint satisfaction problems.
• Constraints: Queens cannot attack each other horizontally, vertically, or diagonally.
• Recursion: The algorithm calls itself to solve smaller sub-problems.

How to Use

1. Start: Click "Start Visualization" to begin the algorithm.
2. Speed: Use the slider to adjust the speed of the animation.
3. Watch: Observe how the algorithm places queens and backtracks when it detects a conflict.

This visualizer is a great way to understand recursion and backtracking concepts in computer science.