{"id":25902767,"url":"https://github.com/scriptraccoon/queens-problem-python","last_synced_at":"2026-04-13T02:49:55.635Z","repository":{"id":204989138,"uuid":"713135255","full_name":"ScriptRaccoon/queens-problem-python","owner":"ScriptRaccoon","description":"Python programs that generate solutions of the n queens problem","archived":false,"fork":false,"pushed_at":"2024-01-26T00:06:02.000Z","size":12,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-03T03:17:15.801Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ScriptRaccoon.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}},"created_at":"2023-11-01T23:01:10.000Z","updated_at":"2023-11-05T15:31:55.000Z","dependencies_parsed_at":"2023-11-02T01:36:20.836Z","dependency_job_id":"95d936c9-1d97-4fa3-9e67-7a8f261ed32c","html_url":"https://github.com/ScriptRaccoon/queens-problem-python","commit_stats":null,"previous_names":["scriptraccoon/queens-problem-python"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ScriptRaccoon/queens-problem-python","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ScriptRaccoon%2Fqueens-problem-python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ScriptRaccoon%2Fqueens-problem-python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ScriptRaccoon%2Fqueens-problem-python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ScriptRaccoon%2Fqueens-problem-python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ScriptRaccoon","download_url":"https://codeload.github.com/ScriptRaccoon/queens-problem-python/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ScriptRaccoon%2Fqueens-problem-python/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31737849,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-12T22:19:12.206Z","status":"online","status_checked_at":"2026-04-13T02:00:06.623Z","response_time":93,"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-03-03T03:17:19.903Z","updated_at":"2026-04-13T02:49:55.596Z","avatar_url":"https://github.com/ScriptRaccoon.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Generator for solutions to the n queens problem\n\nThese Python programs generate solutions to the [n queens problem](https://en.wikipedia.org/wiki/Eight_queens_puzzle). They uses different recursive algorithms and compares them with a benchmark. No backtracking is used, as we don't need it.\n\n-   `queens_gen.py` provides a generator function that generates the solution. This is the fastest solution, in particular when one is interested to see a first solution quickly, and one does not need all solutions directly. Check the docstrings there for more information, as they explain exactly how it is done.\n-   `queens_list.py` has the same algorithm, but uses a list instead. The computation of all solutions takes about the same amount of time. But since this is not a generator, one does not see the first solution before the computation of all solutions is done, which is not what you might want.\n-   `queens_naive.py` is perhaps the most naive recursive implementation, because it does not remember the already taken columns and diagonals, which makes it quite slow.\n\nRelated repository (a web app that visualizes the solutions): https://github.com/ScriptRaccoon/queens-problem-svelte\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fscriptraccoon%2Fqueens-problem-python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fscriptraccoon%2Fqueens-problem-python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fscriptraccoon%2Fqueens-problem-python/lists"}