{"payload":{"header_redesign_enabled":false,"results":[{"id":"665181149","archived":false,"color":"#DA5B0B","followers":1,"has_funding_file":false,"hl_name":"valinsogna/ReinForceMate","hl_trunc_description":"Advanced RL algorithms for two simplified versions of chess. Shortest Path finds the minimal moves between two cells based on piece capab…","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":665181149,"name":"ReinForceMate","owner_id":92598090,"owner_login":"valinsogna","updated_at":"2023-09-18T11:03:41.100Z","has_issues":true}},"sponsorable":false,"topics":["reinforcement-learning","q-learning","sarsa","expected-sarsa","deep-q-learning","sarsa-lambda"],"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":93,"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%253Avalinsogna%252FReinForceMate%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/valinsogna/ReinForceMate/star":{"post":"pZJyJgz2ypz4yT-kLufKiCSqIlmhIddjLtpV-ZKUssMB7O4ofe_ZCk-ezXaO7ed-v5d4nVWA84Ntpto6JPXJqQ"},"/valinsogna/ReinForceMate/unstar":{"post":"juh3_0D4bwse-4wBcZwDZdm0HU8g_hxpavxn3UoHCVRziEoCONXCyPx1cMhHohI4O0XHYlWGX7PVycrau2hlWw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"CmyiB36nTjl4bLq0Mdn69lqR6jeM_AVoz6fnH4dS-KlklCRJq3H6_ll7EzLRANM0kd8I-Hxob3ZIs24pZg95PQ"}}},"title":"Repository search results"}