https://github.com/saisriramkamineni/n-queen-visualizer
A tool called an N-Queens Visualizer is made to show the solutions to the N-Queens issue, which is to arrange N queens on a N×N chessboard so that no two queens may attack one another. The chessboard is usually displayed by the visualizer in an easy-to-read grid format, enabling viewers to see the positions of each queen. A few visualisers
https://github.com/saisriramkamineni/n-queen-visualizer
css html html-css-javascript javascript
Last synced: about 1 month ago
JSON representation
A tool called an N-Queens Visualizer is made to show the solutions to the N-Queens issue, which is to arrange N queens on a N×N chessboard so that no two queens may attack one another. The chessboard is usually displayed by the visualizer in an easy-to-read grid format, enabling viewers to see the positions of each queen. A few visualisers
- Host: GitHub
- URL: https://github.com/saisriramkamineni/n-queen-visualizer
- Owner: SaiSriramKamineni
- Created: 2024-08-25T20:32:46.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2024-08-25T20:34:56.000Z (10 months ago)
- Last Synced: 2025-05-07T13:55:57.963Z (about 1 month ago)
- Topics: css, html, html-css-javascript, javascript
- Language: HTML
- Homepage: https://saisriramkamineni.github.io/N-Queen-Visualizer/
- Size: 13.7 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# ♔ N-Queens Visualizer
## 📖 Introduction
The **N-Queens Visualizer** is an interactive web-based tool designed to help users visualize solutions to the classic N-Queens problem. The N-Queens problem challenges you to place N queens on an N×N chessboard such that no two queens threaten each other. This tool enables you to explore and understand the various configurations that solve the problem.
## ✨ Features
- 🎥 **Interactive Visualization**: Watch the N-Queens problem unfold on a responsive chessboard.
- 📏 **Customizable Board Size**: Input the number of queens (from 1 to 8) to visualize different solutions.
- 🎚️ **Slider Control**: Adjust the speed of the visualization using a slider.
- 📱 **Responsive Design**: The interface is optimized for various screen sizes and devices.
- 📝 **Detailed Output**: Displays the number of possible arrangements and visualizes each solution step-by-step.
## ⚙️ Installation
To run this project locally, follow these steps:
1. Clone the repository:
```bash
git clone https://github.com/SaiSriramKamineni/N-Queen-Visualizer.git
```
2. Navigate to the project directory:
```bash
cd n-queens-visualizer
```
3. Open `index.html` in your preferred web browser.
## 🚀 Usage
1. Open the `index.html` file in your web browser.
2. Enter the number of queens in the input box (1-8).
3. Use the slider to adjust the speed of the visualization.
4. Click the "Play" button to start the visualization.
The chessboard will display all the possible solutions for the given number of queens. The queens will be placed on the board one by one, following the rules of the N-Queens problem.
## 💻 Technologies Used
- 🌐 **HTML**: Structure of the web page.
- 🎨 **CSS**: Styling and layout.
- ⚙️ **JavaScript**: Logic and interactivity of the visualization.
## 🤝 Contributing
Contributions are welcome! If you have suggestions for improving the visualizer, feel free to create an issue or submit a pull request. Let's make this tool even better together! 💡
Happy coding! 🎉
## 📄 Code Examples
### C++
```cpp
#include
#include
using namespace std;
class NQueens {
public:
NQueens(int n) : N(n), board(n, vector(n, false)) {
solve(0);
}
void printSolutions() {
for (const auto& solution : solutions) {
for (const auto& row : solution) {
for (bool cell : row) {
cout << (cell ? "Q " : ". ");
}
cout << endl;
}
cout << endl;
}
}
private:
int N;
vector> board;
vector>> solutions;
void solve(int row) {
if (row == N) {
solutions.push_back(board);
return;
}
for (int col = 0; col < N; ++col) {
if (isValid(row, col)) {
board[row][col] = true;
solve(row + 1);
board[row][col] = false;
}
}
}
bool isValid(int row, int col) {
for (int i = 0; i < row; ++i) {
if (board[i][col] ||
(col - (row - i) >= 0 && board[i][col - (row - i)]) ||
(col + (row - i) < N && board[i][col + (row - i)])) {
return false;
}
}
return true;
}
};
int main() {
int n = 8;
NQueens nQueens(n);
nQueens.printSolutions();
return 0;
}