{"payload":{"header_redesign_enabled":false,"results":[{"id":"334706629","archived":false,"color":"#f1e05a","followers":0,"has_funding_file":false,"hl_name":"Beschuetzer/Knight-s-Tour-Problem","hl_trunc_description":"My implementation of the knightMove function which uses recursion to get the shortest path between two points on a chess board using the …","language":"JavaScript","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":334706629,"name":"Knight-s-Tour-Problem","owner_id":62818816,"owner_login":"Beschuetzer","updated_at":"2023-01-29T18:06:07.116Z","has_issues":true}},"sponsorable":false,"topics":["javascript","tdd","dynamic-programming","practical-exercises"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":52,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253ABeschuetzer%252FKnight-s-Tour-Problem%2B%2Blanguage%253AJavaScript","metadata":null,"csrf_tokens":{"/Beschuetzer/Knight-s-Tour-Problem/star":{"post":"DBhFPkgttAEbvfZcSeCU482TgmkjQiJNbZ3_Fz32GBXnDu2vxg_fRBHBK2SyIXsfhIzogi_xlQR60pjKFfK36A"},"/Beschuetzer/Knight-s-Tour-Problem/unstar":{"post":"pLxharqLbkA3C2JJzLxd9a-ZEGgl8wGU-GEvHgbBD5WDS2MabrLSXq9EB52g8qGQCrR16aDYUJZcwN_F7YHmQA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"W4s6oaefwpnxSBiZbupHZGyukaE0FFwHMvsplkrV1nkLhlcWsgs27l9kqHNQi_I9WabfHVEx5ftIbCs2-cklLw"}}},"title":"Repository search results"}