{"id":26996345,"url":"https://github.com/jelhamm/n-queens-puzzle","last_synced_at":"2026-05-07T18:31:41.495Z","repository":{"id":234288566,"uuid":"788577035","full_name":"jElhamm/N-Queens-Puzzle","owner":"jElhamm","description":"\"The classic 'N-Queens problem' is tackled using a variety of advanced techniques such as nested loops, heuristics, backtracking, genetic algorithms, and local search algorithms.\"","archived":false,"fork":false,"pushed_at":"2024-04-30T17:14:31.000Z","size":14216,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-04-30T18:44:09.518Z","etag":null,"topics":["artificial-intelligence","artificial-intelligence-application","artificial-intelligence-projects","back-tracking","cpp","genetic-algorithm","genetic-algorithm-cpp","genetic-algorithms","genetics","heuristic-algorithm","heuristic-optimization","heuristic-search-algorithms","jupyter-notebook","nested-loops","nqueens-algorithm","nqueens-problem","nqueens-problem-solver","python"],"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/jElhamm.png","metadata":{"files":{"readme":null,"changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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,"publiccode":null,"codemeta":null}},"created_at":"2024-04-18T17:26:03.000Z","updated_at":"2024-04-30T17:14:36.000Z","dependencies_parsed_at":"2024-04-29T18:38:41.513Z","dependency_job_id":null,"html_url":"https://github.com/jElhamm/N-Queens-Puzzle","commit_stats":null,"previous_names":["jelhamm/n-queens-puzzle"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jElhamm%2FN-Queens-Puzzle","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jElhamm%2FN-Queens-Puzzle/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jElhamm%2FN-Queens-Puzzle/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jElhamm%2FN-Queens-Puzzle/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jElhamm","download_url":"https://codeload.github.com/jElhamm/N-Queens-Puzzle/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247103248,"owners_count":20884024,"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":["artificial-intelligence","artificial-intelligence-application","artificial-intelligence-projects","back-tracking","cpp","genetic-algorithm","genetic-algorithm-cpp","genetic-algorithms","genetics","heuristic-algorithm","heuristic-optimization","heuristic-search-algorithms","jupyter-notebook","nested-loops","nqueens-algorithm","nqueens-problem","nqueens-problem-solver","python"],"created_at":"2025-04-04T01:18:16.093Z","updated_at":"2026-05-07T18:31:36.486Z","avatar_url":"https://github.com/jElhamm.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjelhamm%2Fn-queens-puzzle","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjelhamm%2Fn-queens-puzzle","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjelhamm%2Fn-queens-puzzle/lists"}