{"id":15442704,"url":"https://github.com/jaiswalchitransh/n-queens-problem-using-backtracking","last_synced_at":"2025-03-28T07:25:42.119Z","repository":{"id":251334266,"uuid":"837105828","full_name":"jaiswalchitransh/N-Queens-Problem-using-Backtracking","owner":"jaiswalchitransh","description":"The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others.","archived":false,"fork":false,"pushed_at":"2024-08-28T20:42:18.000Z","size":479,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-10-18T13:14:58.295Z","etag":null,"topics":["artificial-intelligence","backtracking","backtracking-algorithm","n-queens","n-queens-problem","project","python","python-3","python3"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jaiswalchitransh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-08-02T08:18:32.000Z","updated_at":"2024-08-28T20:42:21.000Z","dependencies_parsed_at":"2024-08-28T21:56:00.434Z","dependency_job_id":"f1628b44-9b1c-430f-8cac-de701247329a","html_url":"https://github.com/jaiswalchitransh/N-Queens-Problem-using-Backtracking","commit_stats":{"total_commits":10,"total_committers":1,"mean_commits":10.0,"dds":0.0,"last_synced_commit":"87ec61a54f4b865acc1c32600c25a2907ec1c7bc"},"previous_names":["jaiswalchitransh/n-queens-problem-using-backtracking"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FN-Queens-Problem-using-Backtracking","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FN-Queens-Problem-using-Backtracking/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FN-Queens-Problem-using-Backtracking/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FN-Queens-Problem-using-Backtracking/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jaiswalchitransh","download_url":"https://codeload.github.com/jaiswalchitransh/N-Queens-Problem-using-Backtracking/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245986663,"owners_count":20705244,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["artificial-intelligence","backtracking","backtracking-algorithm","n-queens","n-queens-problem","project","python","python-3","python3"],"created_at":"2024-10-01T19:29:31.449Z","updated_at":"2025-03-28T07:25:42.096Z","avatar_url":"https://github.com/jaiswalchitransh.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# N-Queens Problem using Backtracking\n\n## Table of Contents\n- [Project Overview](#project-overview)\n- [Installation](#installation)\n- [Usage](#usage)\n- [Features](#features)\n- [Contribution](#contribution)\n\n\n## Project Overview\nThis Python script solves the N-Queens problem using a backtracking algorithm. The goal of the N-Queens problem is to place N queens on an N×N chessboard such that no two queens threaten each other. The script generates all possible solutions for placing the queens on the board and can handle boards of size N where N is greater than or equal to 4. It employs a depth-first search approach to explore possible placements of queens and backtracks when a conflict is detected.\n\nThe script accepts the size of the chessboard from the user, then calculates and displays one of the possible solutions randomly, along with the total number of solutions.\n\n\n## Installation\nThis project requires Python 3.12.1 or later.\nTo set up the project:\n1. Ensure Python 3.12.1 or a later version is installed on your system. You can download Python from [python.org](https://www.python.org/downloads/).\n2. Clone or download the repository to your local machine.\n\n          https://github.com/jaiswalchitransh/N-Queens-Problem-using-Backtracking.git\n\n4. Open the project in your preferred Python environment (e.g., IDE or terminal).\n5. Run the script (`n-queens.py`) and observe the output.\n\n\n## Usage\nRun the script:\n\n         python n-queens.py\n\nFollow the on-screen prompts to input the size of the chessboard. The script will then compute and display one of the solutions to the N-Queens problem and the total number of possible solutions.\n\n\n## Features\n- **Backtracking Algorithm**: Efficiently finds all solutions by exploring possible placements of queens.\n- **Random Solution Display**: Randomly selects and prints one of the valid solutions.\n- **Solution Count**: Outputs the total number of solutions for the given board size.\n\n\n## Contribution\nI, **[Chitransh Jaiswal](https://www.linkedin.com/in/jaiswalchitransh/)** developed this Project Individually. I was responsible for all aspects of the project, including design, development, testing, and documentation.\nContributions to improve the efficiency, readability, or functionality of the code are welcome. To contribute:\n1. Fork the repository.\n2. Create a new branch (`git checkout -b feature/your-feature`).\n3. Make your changes.\n4. Commit your changes (`git commit -am 'Add some feature'`).\n5. Push to the branch (`git push origin feature/your-feature`).\n6. Create a new Pull Request.\n\nPlease ensure your contributions adhere to the coding standards and follow the existing style and structure.\n\n---\n\nThank you for your interest in the N-Queens problem solver. Explore the solutions to this classic problem and contribute to further enhancements!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaiswalchitransh%2Fn-queens-problem-using-backtracking","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjaiswalchitransh%2Fn-queens-problem-using-backtracking","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaiswalchitransh%2Fn-queens-problem-using-backtracking/lists"}