{"id":18478510,"url":"https://github.com/danielbrodi/knights-tour","last_synced_at":"2025-05-13T18:28:33.535Z","repository":{"id":145152526,"uuid":"397750360","full_name":"danielbrodi/Knights-Tour","owner":"danielbrodi","description":"The Knight’s tour problem solved in C with both the naive and the heuristic solutions, using a backtracking algorithm, recursion and a bit array. Includes GUI,","archived":false,"fork":false,"pushed_at":"2021-09-15T22:58:21.000Z","size":354,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2023-03-22T16:26:00.982Z","etag":null,"topics":["backtracking","backtracking-algorithm","c","chess","chess-ai","chess-board","chess-game","chessboard","heuristic-algorithm","heuristic-search","heuristic-search-algorithms","heuristics","knight-problem","knight-tour","knights-tour","knightstour","memory-management","options-strategies","recursion","recursive-algorithm"],"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/danielbrodi.png","metadata":{},"created_at":"2021-08-18T22:29:51.000Z","updated_at":"2023-03-11T21:23:44.000Z","dependencies_parsed_at":null,"dependency_job_id":"f9331623-ebae-4a3a-8da2-fdbdda46c682","html_url":"https://github.com/danielbrodi/Knights-Tour","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbrodi%2FKnights-Tour","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbrodi%2FKnights-Tour/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbrodi%2FKnights-Tour/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbrodi%2FKnights-Tour/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/danielbrodi","download_url":"https://codeload.github.com/danielbrodi/Knights-Tour/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":223335107,"owners_count":17128521,"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":["backtracking","backtracking-algorithm","c","chess","chess-ai","chess-board","chess-game","chessboard","heuristic-algorithm","heuristic-search","heuristic-search-algorithms","heuristics","knight-problem","knight-tour","knights-tour","knightstour","memory-management","options-strategies","recursion","recursive-algorithm"],"created_at":"2024-11-06T12:10:21.819Z","updated_at":"2024-11-06T12:10:22.057Z","avatar_url":"https://github.com/danielbrodi.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanielbrodi%2Fknights-tour","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdanielbrodi%2Fknights-tour","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanielbrodi%2Fknights-tour/lists"}