{"id":20304367,"url":"https://github.com/dev-michael-schmidt/n-queens","last_synced_at":"2026-06-01T03:32:38.500Z","repository":{"id":106652900,"uuid":"147981626","full_name":"dev-michael-schmidt/n-queens","owner":"dev-michael-schmidt","description":"Solve the classic N-Queens problem using a variety of techniques including Greedy Local Search, genetic algorithm, and DFS/Backtracking","archived":false,"fork":false,"pushed_at":"2019-01-10T14:43:56.000Z","size":49,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-07T15:05:52.427Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","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/dev-michael-schmidt.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}},"created_at":"2018-09-09T00:59:05.000Z","updated_at":"2019-05-13T16:48:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"87130de4-c57e-403a-b8e6-9a1fd6f14e6c","html_url":"https://github.com/dev-michael-schmidt/n-queens","commit_stats":null,"previous_names":["dev-michael-schmidt/n-queens"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dev-michael-schmidt/n-queens","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dev-michael-schmidt%2Fn-queens","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dev-michael-schmidt%2Fn-queens/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dev-michael-schmidt%2Fn-queens/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dev-michael-schmidt%2Fn-queens/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dev-michael-schmidt","download_url":"https://codeload.github.com/dev-michael-schmidt/n-queens/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dev-michael-schmidt%2Fn-queens/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33759178,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-01T02:00:06.963Z","response_time":115,"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":"2024-11-14T16:43:59.182Z","updated_at":"2026-06-01T03:32:38.481Z","avatar_url":"https://github.com/dev-michael-schmidt.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# n-queens\nThe classic problem of placing \"queen\" chess pieces on an N×N board such that no queen attacks any other queen.  Queen pieces move vertically, horizontally, and both diagonals.  This repo implements search algorithms to solve this problem in both C++ and Python programming languages.\n\n- C++\n    - Depth First Search\n    - Greedy Local Search\n    - Genetic Search\n    - Simulated Annealing (under RESEARCH)\n\n\n- Python  \n    - Depth First Search\n    - Greedy Local Search\n    - Genetic Search (under development)\n\n## C++\nCurrently, genetic search performs slower than both depth first and greedy local search algorithms.\n\n#### Building:\nthe usual:  `make`\n\n#### Usage:\n`./n-queens \u003cseed\u003e \u003cN\u003e`, where seed is used to seed the random generator, and N is used to specify the board size.\n\n\n## Python:\nCurrently, no main driver exists for Python classes.  A module will be created in the future with a driver script.\n\n#### Usage:\n`python3 depth_first.py`  \n`python3 greedy_local.py`\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdev-michael-schmidt%2Fn-queens","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdev-michael-schmidt%2Fn-queens","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdev-michael-schmidt%2Fn-queens/lists"}