{"id":9532253,"url":"https://github.com/jdswalker/N-Queens_Problem","last_synced_at":"2025-08-23T16:31:15.787Z","repository":{"id":239505425,"uuid":"79405635","full_name":"jdswalker/N-Queens_Problem","owner":"jdswalker","description":"N-Queens problem solvers and solution counters implemented using a constrained DFS algorithm","archived":false,"fork":false,"pushed_at":"2017-10-24T03:53:23.000Z","size":383,"stargazers_count":5,"open_issues_count":0,"forks_count":4,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-08-29T17:57:40.727Z","etag":null,"topics":["bash-script","c","c99","constrained-dfs-algorithm","constraint-programming","depth-first-search","dfs-algorithm","go","golang","n-queens","python","r","r-language","shell"],"latest_commit_sha":null,"homepage":"","language":"C","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/jdswalker.png","metadata":{},"created_at":"2017-01-19T02:09:21.000Z","updated_at":"2023-12-28T08:34:35.000Z","dependencies_parsed_at":null,"dependency_job_id":"9f81abdd-82db-473c-9499-737ba7d7e90b","html_url":"https://github.com/jdswalker/N-Queens_Problem","commit_stats":null,"previous_names":["jdswalker/n-queens_problem"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jdswalker%2FN-Queens_Problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jdswalker%2FN-Queens_Problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jdswalker%2FN-Queens_Problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jdswalker%2FN-Queens_Problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jdswalker","download_url":"https://codeload.github.com/jdswalker/N-Queens_Problem/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":230711503,"owners_count":18269192,"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":["bash-script","c","c99","constrained-dfs-algorithm","constraint-programming","depth-first-search","dfs-algorithm","go","golang","n-queens","python","r","r-language","shell"],"created_at":"2024-05-12T23:33:37.029Z","updated_at":"2024-12-21T11:30:30.734Z","avatar_url":"https://github.com/jdswalker.png","language":"C","readme":null,"funding_links":[],"categories":["Repositories"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjdswalker%2FN-Queens_Problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjdswalker%2FN-Queens_Problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjdswalker%2FN-Queens_Problem/lists"}