-
Notifications
You must be signed in to change notification settings - Fork 365
Added N-Queen Visualizer | Issue #825 #880
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from 6 commits
Commits
Show all changes
9 commits
Select commit
Hold shift + click to select a range
3331bb7
Update README.md
Shariq2003 a316558
Added N-Queen Visualizer
Shariq2003 39863b9
Update README.md
Shariq2003 b152677
Conflicts Resolves
Shariq2003 5e523d1
Conficts Resolves
Shariq2003 ff84ebc
Fixes
Shariq2003 75449ff
Fixes
Shariq2003 4374729
Fixes
Shariq2003 06d7c7c
enlisting-fixes
Avdhesh-Varshney File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,69 @@ | ||
| # N-Queens Visualiser | ||
|
|
||
| Welcome to the **N-Queens Visualiser**! This web application allows you to visualize the classic N-Queens problem, where the objective is to place N queens on an N x N chessboard such that no two queens threaten each other. This is achieved by ensuring that no two queens share the same row, column, or diagonal. | ||
|
|
||
| ## Table of Contents | ||
|
|
||
| - [Features](#features) | ||
| - [Technologies Used](#technologies-used) | ||
| - [Getting Started](#getting-started) | ||
| - [How to Use](#how-to-use) | ||
| - [Contributing](#contributing) | ||
| - [License](#license) | ||
|
|
||
| ## Features | ||
|
|
||
| - Interactive visualization of the N-Queens problem | ||
| - Ability to input the number of queens (up to 8) | ||
| - Slider for controlling the speed of visualization | ||
| - Displays all possible arrangements of queens for the given input | ||
| - Responsive design for both desktop and mobile | ||
|
|
||
| ## Technologies Used | ||
|
|
||
| - HTML | ||
| - CSS | ||
| - JavaScript | ||
| - [Font Awesome](https://fontawesome.com/) for icons | ||
|
|
||
| ## Getting Started | ||
|
|
||
| To get a local copy up and running follow these simple steps: | ||
|
|
||
| 1. Clone the repository: | ||
|
|
||
| ```bash | ||
| git clone https://github.com/yourusername/N-Queens-Visualiser.git | ||
| ``` | ||
| 2. Navigate to the project directory: | ||
| ```bash | ||
| cd N-Queens-Visualiser | ||
| ``` | ||
| 3. Open index.html in your web browser. | ||
|
|
||
| ## How to Use | ||
| 1. Enter the number of queens you want to place on the chessboard in the input field. | ||
| 2. Use the slider to adjust the speed of the visualization. | ||
| 3. Click the Play button to start the visualization. | ||
| 4. You can stop the visualization at any time. | ||
|
|
||
|
|
||
| ## Contributing | ||
| Contributions are welcome! Please follow these steps to contribute to this project: | ||
|
|
||
| 1. Fork the repository. | ||
| 2. Create a new branch (git checkout -b feature/YourFeature). | ||
| 3. Commit your changes (git commit -m 'Add some feature'). | ||
| 4. Push to the branch (git push origin feature/YourFeature). | ||
| 5. Open a Pull Request. | ||
|
|
||
| ## Screenshots | ||
|
|
||
|  | ||
|
|
||
|  | ||
|
|
||
| https://github.com/user-attachments/assets/158578b8-81c2-46b8-bc90-c52e23d20c5b | ||
|
|
||
|
|
||
|
|
250 changes: 250 additions & 0 deletions
250
Vanilla-JS-Projects/Advanced/N-Queen-Visualizer/chess.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,250 @@ | ||
| const numberbox = document.getElementById("numberbox"); | ||
| const slider = document.getElementById("slider"); | ||
| const progressBar = document.getElementById("progress-bar") | ||
| const playButton = document.getElementById('play-button'); | ||
| const pauseButton = document.getElementById("pause-button"); | ||
| const queen = '<i class="fas fa-chess-queen" style="color:#000"></i>'; | ||
|
|
||
| let isMainContainerVisible = false; | ||
|
|
||
| function toggleVisibility() { | ||
| const landingPage = document.querySelector('.landing-div'); | ||
| const mainContainer = document.querySelector('.n-queen'); | ||
|
|
||
| if (isMainContainerVisible) { | ||
| landingPage.style.display = 'none'; | ||
| mainContainer.style.display = 'flex'; | ||
| } else { | ||
| landingPage.style.display = 'block'; | ||
| mainContainer.style.display = 'none'; | ||
| } | ||
| } | ||
| window.onload = toggleVisibility; | ||
| document.getElementById('start-button').onclick = function () { | ||
| isMainContainerVisible = true; | ||
| toggleVisibility(); | ||
| }; | ||
|
|
||
|
|
||
| let n, speed, tempSpeed, q, Board = 0; | ||
| let array = [0, 2, 1, 1, 3, 11, 5, 41, 93]; | ||
|
|
||
| // Used to store the state of the boards; | ||
| let pos = {}; | ||
|
|
||
| speed = (100 - slider.value) * 10; | ||
| tempSpeed = speed; | ||
| slider.oninput = function () { | ||
| progressBar.style.width = this.value + "%"; | ||
| const sliderValue = parseInt(this.value, 10); | ||
| if (sliderValue <= 25) { | ||
| progressBar.style.backgroundColor = "green"; | ||
| slider.className = 'slider green'; | ||
| } else if (sliderValue > 25 && sliderValue <= 75) { | ||
| progressBar.style.backgroundColor = "#ffd200"; | ||
| slider.className = 'slider yellow'; | ||
| } else { | ||
| progressBar.style.backgroundColor = "red"; | ||
| slider.className = 'slider red'; | ||
| } | ||
|
|
||
| speed = sliderValue; | ||
| speed = (100 - speed) * 10; | ||
| }; | ||
|
|
||
|
|
||
|
|
||
| class Queen { | ||
| constructor() { | ||
| this.position = Object.assign({}, pos); | ||
| this.uuid = []; | ||
| } | ||
|
|
||
| nQueen = async () => { | ||
| Board = 0; | ||
| this.position[`${Board}`] = {}; | ||
| numberbox.disabled = true; | ||
| await q.solveQueen(Board, 0, n); | ||
| await q.clearColor(Board); | ||
| numberbox.disabled = false; | ||
| } | ||
|
|
||
| isValid = async (board, r, col, n) => { | ||
| //Setting the current box color to orange | ||
| const table = document.getElementById(`table-${this.uuid[board]}`); | ||
| const currentRow = table.firstChild.childNodes[r]; | ||
| const currentColumn = currentRow.getElementsByTagName("td")[col]; | ||
| currentColumn.innerHTML = queen; | ||
| await q.delay(); | ||
|
|
||
| // Checking the queen in the same column | ||
| for (let i = r - 1; i >= 0; --i) { | ||
| const row = table.firstChild.childNodes[i]; | ||
| const column = row.getElementsByTagName("td")[col]; | ||
| const value = column.innerHTML; | ||
|
|
||
| if (value == queen) { | ||
| column.style.backgroundColor = "#ff0000"; | ||
| currentColumn.innerHTML = "-" | ||
| return false; | ||
| } | ||
| column.style.backgroundColor = "#ddff00"; | ||
| await q.delay(); | ||
| } | ||
|
|
||
| //Checking the upper left diagonal | ||
| for (let i = r - 1, j = col - 1; i >= 0 && j >= 0; --i, --j) { | ||
| const row = table.firstChild.childNodes[i]; | ||
| const column = row.getElementsByTagName("td")[j]; | ||
| const value = column.innerHTML; | ||
|
|
||
| if (value == queen) { | ||
| column.style.backgroundColor = "#fb5607"; | ||
| currentColumn.innerHTML = "-" | ||
| return false; | ||
| } | ||
| column.style.backgroundColor = "#ffca3a"; | ||
| await q.delay(); | ||
| } | ||
|
|
||
| // Checking the upper right diagonal | ||
| for (let i = r - 1, j = col + 1; i >= 0 && j < n; --i, ++j) { | ||
| const row = table.firstChild.childNodes[i]; | ||
| const column = row.getElementsByTagName("td")[j]; | ||
|
|
||
| const value = column.innerHTML; | ||
|
|
||
| if (value == queen) { | ||
| column.style.backgroundColor = "#FB5607"; | ||
| currentColumn.innerHTML = "-" | ||
| return false; | ||
| } | ||
| column.style.backgroundColor = "#ffca3a"; | ||
| await q.delay(); | ||
| } | ||
| return true; | ||
| } | ||
|
|
||
| clearColor = async (board) => { | ||
| for (let j = 0; j < n; ++j) { | ||
| const table = document.getElementById(`table-${this.uuid[board]}`); | ||
| const row = table.firstChild.childNodes[j]; | ||
| for (let k = 0; k < n; ++k) | ||
| (j + k) & 1 | ||
| ? (row.getElementsByTagName("td")[k].style.backgroundColor = "#03852e") | ||
| : (row.getElementsByTagName("td")[k].style.backgroundColor = "#ffffff"); | ||
| } | ||
| } | ||
|
|
||
| delay = async () => { | ||
| await new Promise((done) => setTimeout(() => done(), speed)); | ||
| } | ||
|
|
||
| solveQueen = async (board, r, n) => { | ||
| if (r == n) { | ||
| ++Board; | ||
| let table = document.getElementById(`table-${this.uuid[Board]}`); | ||
| for (let k = 0; k < n; ++k) { | ||
| let row = table.firstChild.childNodes[k]; | ||
| row.getElementsByTagName("td")[this.position[board][k]].innerHTML = queen; | ||
| } | ||
| this.position[Board] = this.position[board]; | ||
| return; | ||
| } | ||
|
|
||
| for (let i = 0; i < n; ++i) { | ||
| await q.delay(); | ||
| // console.log("outside:" + board); | ||
| await q.clearColor(board); | ||
| if (await q.isValid(board, r, i, n)) { | ||
| await q.delay(); | ||
| // console.log("inside:" + board) | ||
| await q.clearColor(board); | ||
| let table = document.getElementById(`table-${this.uuid[board]}`); | ||
| let row = table.firstChild.childNodes[r]; | ||
| row.getElementsByTagName("td")[i].innerHTML = queen; | ||
|
|
||
| this.position[board][r] = i; | ||
|
|
||
| if (await q.solveQueen(board, r + 1, n)) | ||
| await q.clearColor(board); | ||
|
|
||
| await q.delay(); | ||
| board = Board; | ||
| // console.log(this.Board) | ||
| table = document.getElementById(`table-${this.uuid[board]}`); | ||
| // console.log(JSON.parse(JSON.stringify(table))); | ||
| row = table.firstChild.childNodes[r]; | ||
| row.getElementsByTagName("td")[i].innerHTML = "-"; | ||
|
|
||
| delete this.position[`${board}`][`${r}`]; | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| playButton.onclick = async function visualise() { | ||
| const chessBoard = document.getElementById("n-queen-board"); | ||
| const arrangement = document.getElementById("queen-arrangement"); | ||
|
|
||
| n = numberbox.value; | ||
| q = new Queen(); | ||
|
|
||
| if (n > 8) { | ||
| numberbox.value = ""; | ||
| alert("Queen value is too large"); | ||
| return; | ||
| } else if (n < 1) { | ||
| numberbox.value = ""; | ||
| alert("Queen value is too small"); | ||
| return; | ||
| } | ||
|
|
||
| // Removing all the of previous execution context | ||
| while (chessBoard.hasChildNodes()) { | ||
| chessBoard.removeChild(chessBoard.firstChild); | ||
| } | ||
| if (arrangement.hasChildNodes()) { | ||
| arrangement.removeChild(arrangement.lastChild) | ||
| } | ||
|
|
||
| const para = document.createElement("p"); | ||
| para.setAttribute("class", "queen-info"); | ||
| para.innerHTML = `For ${n}x${n} board, ${array[n] - 1} arrangements are possible.`; | ||
Check warningCode scanning / CodeQL DOM text reinterpreted as HTML Medium DOM text Error loading related location Loading |
||
| arrangement.appendChild(para); | ||
|
|
||
| //Adding boards to the Div | ||
| if (chessBoard.childElementCount === 0) { | ||
| for (let i = 0; i < array[n]; ++i) { | ||
| q.uuid.push(Math.random()); | ||
| let div = document.createElement('div'); | ||
| let table = document.createElement('table'); | ||
| let header = document.createElement('h4'); | ||
| // div.setAttribute("id", `div-${100 + uuid[i]}`) | ||
| header.innerHTML = `Board ${i + 1} ` | ||
| table.setAttribute("id", `table-${q.uuid[i]}`); | ||
| header.setAttribute("id", `paragraph-${i}`); | ||
| chessBoard.appendChild(div); | ||
| div.appendChild(header); | ||
| div.appendChild(table); | ||
| } | ||
| } | ||
|
|
||
| for (let k = 0; k < array[n]; ++k) { | ||
| let table = document.getElementById(`table-${q.uuid[k]}`); | ||
| for (let i = 0; i < n; ++i) { | ||
| const row = table.insertRow(i); // inserting ith row | ||
| row.setAttribute("id", `Row${i} `); | ||
| for (let j = 0; j < n; ++j) { | ||
| const col = row.insertCell(j); // inserting jth column | ||
| (i + j) & 1 | ||
| ? (col.style.backgroundColor = "#FF9F1C") | ||
| : (col.style.backgroundColor = "#FCCD90"); | ||
| col.innerHTML = "-"; | ||
| col.style.border = "0.3px solid #373f51"; | ||
| } | ||
| } | ||
| await q.clearColor(k); | ||
| } | ||
| await q.nQueen(); | ||
| }; | ||
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.