Create program.c #1344
Merged
Create program.c #1344
Conversation
This file contains 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
The N-Queens Problem is a classic problem where the objective is to place N queens on an N x N chessboard such that no two queens can attack each other. A queen can attack any other piece in the same row, column, or diagonal, making it challenging to place all N queens without conflict.
![github-actions[bot]](https://avatars.githubusercontent.com/in/15368?s=60&v=4){kind=small}
There was a problem hiding this comment.
👋 Hi @kaabilcoder! Thank you for submitting your first pull request to the Algo project. Great job on the contribution! 🎉 We appreciate your efforts, and our team will review it soon. If you have any questions, feel free to ask. Keep up the great work! 🚀
There was a problem hiding this comment.
🎉 Great job, @kaabilcoder! Thank you for submitting your pull request. We appreciate your contribution, and our team will review it shortly.
⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀
|
ajay-dhangar
added
gssoc-ext
ajay-dhangar
requested changes
Oct 27, 2024
|
got it |
The N-Queens Problem is a classic problem where the objective is to place N queens on an N x N chessboard such that no two queens can attack each other. A queen can attack any other piece in the same row, column, or diagonal, making it challenging to place all N queens without conflict.
ajay-dhangar
requested changes
Nov 3, 2024
updated the code, it's format and syntax as per the guidelines and suggestions.
ajay-dhangar
requested changes
Nov 3, 2024
Updated the given suggestions on this code.
|
Thank you sir for your suggestion! I have updated the changes which you
have mentioned so please review the check once and also by mistakely i have
been removed from the assignee by mistakely clicked the unassign button. So
i request to reassign this issue to me again and review my code.
…On Sun, 3 Nov 2024 at 12:37, Ajay Dhangar ***@***.***> wrote:
***@***.**** requested changes on this pull request.
update your code based on suggestions
------------------------------
In docs/backtracking algorithms/N-QueensProblem.md
<#1344 (comment)>:
> @@ -0,0 +1,149 @@
+---
+id: N-Queens Problem
replace id: N-Queens Problem with id: n-queens-problem
------------------------------
In docs/backtracking algorithms/N-QueensProblem.md
<#1344 (comment)>:
> +3. Check if placing a queen is safe (no other queens can attack it).
+4. If safe, place the queen and move to the next row.
+5. If a position is not safe or leads to no solution, backtrack by removing the queen and trying a different column.
+6. Repeat until all queens are placed or no solution is found.
+
+### Functions:
+1. **isSafe(row, col)**: Checks if placing a queen at `(row, col)` is safe.
+2. **solveNQueens(row)**: Recursively places queens row by row and uses backtracking when necessary.
+3. **printSolution()**: Displays a valid chessboard configuration.
+
+## Time Complexity
+
+The time complexity for solving the N-Queens problem using backtracking is `O(N!)`, since we try placing a queen in every column of each row and backtrack if needed.
+
+## Program:
+```
replace line 43 ``` with ```c
—
Reply to this email directly, view it on GitHub
<#1344 (review)>,
or unsubscribe
<https://github.com/notifications/unsubscribe-auth/BIY6COQP26B74UWS6LGR7LDZ6XDRRAVCNFSM6AAAAABQVNRIB2VHI2DSMVQWIX3LMV43YUDVNRWFEZLROVSXG5CSMV3GSZLXHMZDIMJRG44TCNZVGE>
.
You are receiving this because you were assigned.Message ID:
***@***.***>
|
|
🎉🎉 Thank you for your contribution! Your PR #1344 has been merged! 🎉🎉 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
The N-Queens Problem is a classic problem where the objective is to place N queens on an N x N chessboard such that no two queens can attack each other. A queen can attack any other piece in the same row, column, or diagonal, making it challenging to place all N queens without conflict.