{"id":39977978,"url":"https://github.com/jer96/n-queens-solver","last_synced_at":"2026-01-18T23:00:45.909Z","repository":{"id":148747167,"uuid":"50807688","full_name":"jer96/N-Queens-Solver","owner":"jer96","description":"Backtracking and Minimal Conflict algorithms to solve the N-queens problem","archived":false,"fork":false,"pushed_at":"2016-02-01T02:24:53.000Z","size":5,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2023-03-29T13:30:45.770Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Racket","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/jer96.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}},"created_at":"2016-02-01T02:17:11.000Z","updated_at":"2023-04-23T23:36:22.048Z","dependencies_parsed_at":"2023-04-24T02:32:23.276Z","dependency_job_id":null,"html_url":"https://github.com/jer96/N-Queens-Solver","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"purl":"pkg:github/jer96/N-Queens-Solver","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jer96%2FN-Queens-Solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jer96%2FN-Queens-Solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jer96%2FN-Queens-Solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jer96%2FN-Queens-Solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jer96","download_url":"https://codeload.github.com/jer96/N-Queens-Solver/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jer96%2FN-Queens-Solver/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28553055,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-18T20:59:07.572Z","status":"ssl_error","status_checked_at":"2026-01-18T20:59:02.799Z","response_time":98,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":"2026-01-18T23:00:39.830Z","updated_at":"2026-01-18T23:00:45.881Z","avatar_url":"https://github.com/jer96.png","language":"Racket","funding_links":[],"categories":[],"sub_categories":[],"readme":"# N-Queens-Solver\nBacktracking and Minimal Conflict algorithms to solve the N-queens problem\nProgrammed in the R5RS language in Scheme\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjer96%2Fn-queens-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjer96%2Fn-queens-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjer96%2Fn-queens-solver/lists"}