{"id":17228433,"url":"https://github.com/LazoVelko/N-Queens-Problem","last_synced_at":"2026-07-08T04:30:17.782Z","repository":{"id":127103959,"uuid":"81627479","full_name":"LazoCoder/N-Queens-Problem","owner":"LazoCoder","description":"Placing N chess queens on an NxN chessboard so that no two queens threaten each other.","archived":false,"fork":false,"pushed_at":"2017-02-14T04:52:44.000Z","size":220,"stargazers_count":7,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-06T04:51:15.141Z","etag":null,"topics":["blind-search","iterative-repair","n-queens","queen","queens","search"],"latest_commit_sha":null,"homepage":null,"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/LazoCoder.png","metadata":{},"created_at":"2017-02-11T03:19:32.000Z","updated_at":"2025-01-24T23:25:16.000Z","dependencies_parsed_at":null,"dependency_job_id":"6e3322b5-a4e1-4fab-84ed-5d3707d99ff6","html_url":"https://github.com/LazoCoder/N-Queens-Problem","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LazoCoder%2FN-Queens-Problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LazoCoder%2FN-Queens-Problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LazoCoder%2FN-Queens-Problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LazoCoder%2FN-Queens-Problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LazoCoder","download_url":"https://codeload.github.com/LazoCoder/N-Queens-Problem/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240136983,"owners_count":19753646,"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":["blind-search","iterative-repair","n-queens","queen","queens","search"],"created_at":"2024-10-15T04:44:02.396Z","updated_at":"2026-07-08T04:30:17.765Z","avatar_url":"https://github.com/LazoCoder.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FLazoVelko%2FN-Queens-Problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FLazoVelko%2FN-Queens-Problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FLazoVelko%2FN-Queens-Problem/lists"}