{"id":20110536,"url":"https://github.com/orelba/knights-travails","last_synced_at":"2026-06-08T19:31:40.673Z","repository":{"id":169192473,"uuid":"599770795","full_name":"Orelba/knights-travails","owner":"Orelba","description":"Finding the shortest path of a chess knight from point A to point B on a chessboard using a BFS algorithm","archived":false,"fork":false,"pushed_at":"2023-02-20T17:23:37.000Z","size":2,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-02T18:34:54.163Z","etag":null,"topics":["breadth-first-search","computer-science","data-structures","graph-algorithms"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/Orelba.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-02-09T21:02:33.000Z","updated_at":"2023-02-20T17:23:42.000Z","dependencies_parsed_at":null,"dependency_job_id":"90fbc685-2bb2-418e-9763-2439a104ea4b","html_url":"https://github.com/Orelba/knights-travails","commit_stats":null,"previous_names":["orelba/knights-travails"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Orelba/knights-travails","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Orelba%2Fknights-travails","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Orelba%2Fknights-travails/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Orelba%2Fknights-travails/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Orelba%2Fknights-travails/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Orelba","download_url":"https://codeload.github.com/Orelba/knights-travails/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Orelba%2Fknights-travails/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34078019,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-08T02:00:07.615Z","response_time":111,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["breadth-first-search","computer-science","data-structures","graph-algorithms"],"created_at":"2024-11-13T18:12:19.805Z","updated_at":"2026-06-08T19:31:40.656Z","avatar_url":"https://github.com/Orelba.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Knights Travails\n\nAn implementation of a BFS algorithm to solve the 'Knights Travails' problem,\nfinding the shortest path for a chess knight to move from point A to point B on a standard 8x8 chessboard.\n\n## To run the script:\nRun `script.js`.\n\nThere are already a few demonstration of usage there,\nyou can use your own coordinates to get different paths.\n\n## Usage:\n* `KnightMoves(source, destination)` - the following function will receive the coordinates of the source and destination squares in the form of two arrays of [x, y].  \nthe function return the number of moves needed to complete the path and the coordinates of each square in the path.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Forelba%2Fknights-travails","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Forelba%2Fknights-travails","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Forelba%2Fknights-travails/lists"}