{"payload":{"header_redesign_enabled":false,"results":[{"id":"772912922","archived":false,"color":"#3572A5","followers":3,"has_funding_file":false,"hl_name":"Mehranalam/Knight-tour-theory","hl_trunc_description":"A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. If the knight e…","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":772912922,"name":"Knight-tour-theory","owner_id":77109284,"owner_login":"Mehranalam","updated_at":"2024-03-16T17:28:36.006Z","has_issues":true}},"sponsorable":false,"topics":[],"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":64,"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%253AMehranalam%252FKnight-tour-theory%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/Mehranalam/Knight-tour-theory/star":{"post":"pH66uJ6JR3vYLlqTRnEfYk6c7NJ_zNCHgJl31TYIORH9NsW3tWvFpv6xHvxF0CEqJZreM8rV2x-hPyL0tY6pDA"},"/Mehranalam/Knight-tour-theory/unstar":{"post":"oDLNMdjXRfmB61sjSIoCAl_z_gMA8k4Vb_4M8UbqDvYYnrmFXBKbMB4TSyrh7sczJVp1WWvydm80iY8OcAbuKg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"74K2h6R-8zyQ8rrfSXigzT_ZdUCMO1mP153YijnTcLSSkoE_7cZeM9NFpFix0jb0j_0z2eFYalPciz8_JpqdGw"}}},"title":"Repository search results"}