{"id":30119754,"url":"https://github.com/phyulwin/8-queens-problem-machine-learning","last_synced_at":"2025-08-10T12:42:15.247Z","repository":{"id":280572117,"uuid":"942447200","full_name":"phyulwin/8-queens-problem-machine-learning","owner":"phyulwin","description":"The 8 Queens Problem is a classic puzzle in Artificial Intelligence and combinatorial optimization. It involves placing 8 queens on an 8x8 chessboard such that no two queens threaten each other.","archived":false,"fork":false,"pushed_at":"2025-08-07T06:58:06.000Z","size":1397,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-07T08:42:24.734Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Java","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/phyulwin.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,"zenodo":null}},"created_at":"2025-03-04T05:52:52.000Z","updated_at":"2025-08-07T06:58:09.000Z","dependencies_parsed_at":"2025-08-07T08:42:30.302Z","dependency_job_id":"a00f2e1b-293e-45ba-bddc-a3a47dfa99e7","html_url":"https://github.com/phyulwin/8-queens-problem-machine-learning","commit_stats":null,"previous_names":["phyulwin/cpp-cs4200-artificial-intelligence-8-queens-problem","phyulwin/8-queens-problem-machine-learning"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/phyulwin/8-queens-problem-machine-learning","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phyulwin%2F8-queens-problem-machine-learning","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phyulwin%2F8-queens-problem-machine-learning/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phyulwin%2F8-queens-problem-machine-learning/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phyulwin%2F8-queens-problem-machine-learning/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/phyulwin","download_url":"https://codeload.github.com/phyulwin/8-queens-problem-machine-learning/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phyulwin%2F8-queens-problem-machine-learning/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269726446,"owners_count":24465376,"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","status":"online","status_checked_at":"2025-08-10T02:00:08.965Z","response_time":71,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2025-08-10T12:42:14.579Z","updated_at":"2025-08-10T12:42:15.225Z","avatar_url":"https://github.com/phyulwin.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 8 Queens Problem in Artificial Intelligence\n\nThe 8 Queens Problem is a classic puzzle in Artificial Intelligence and combinatorial optimization. It involves placing 8 queens on an 8x8 chessboard such that no two queens threaten each other. This means no two queens can share the same row, column, or diagonal. The most efficient way to solve the problem is through backtracking, which systematically explores all possible configurations. \n\nProblem Description: The goal is to find all valid configurations where the queens can be placed without violating the constraints. This problem can be generalized to the N Queens Problem, where N queens are placed on an NxN chessboard.\n\n### Solution Screenshots\n\n#### Solution Example 1  \n![Solution 1](KellyLwinCS42008QueensProblem/KellyLwinCS42008QueensProblem/ProgramScreenshots/Screenshot%202025-03-03%20214901.jpg)\n\n#### Solution Example 2  \n![Solution 2](KellyLwinCS42008QueensProblem/KellyLwinCS42008QueensProblem/ProgramScreenshots/Screenshot%202025-03-03%20214920.jpg)\n\n#### Solution Example 3  \n![Solution 3](KellyLwinCS42008QueensProblem/KellyLwinCS42008QueensProblem/ProgramScreenshots/Screenshot%202025-03-03%20214931.jpg)\n\n#### Solution Example 4  \n![Solution 4](KellyLwinCS42008QueensProblem/KellyLwinCS42008QueensProblem/ProgramScreenshots/Screenshot%202025-03-03%20214940.jpg)\n\n#### Solution Example 5  \n![Solution 5](KellyLwinCS42008QueensProblem/KellyLwinCS42008QueensProblem/ProgramScreenshots/Screenshot%202025-03-03%20214952.jpg)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fphyulwin%2F8-queens-problem-machine-learning","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fphyulwin%2F8-queens-problem-machine-learning","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fphyulwin%2F8-queens-problem-machine-learning/lists"}