{"push_id":2725579217,"size":1,"distinct_size":1,"ref":"refs/heads/Python","head":"0b14367fe55c7e1422fdb000f186cfb6d70bd0ac","before":"34429333435697ee87e9be6836fe781d77fc9206","commits":[{"sha":"0b14367fe55c7e1422fdb000f186cfb6d70bd0ac","author":{"name":"Gabriele Frattaroli","email":"9e68cb951234fe51df1f0a649d6f7a016009f6c9@gmail.com"},"message":"Hill-Climbing Algorithm\n\nAn example of how to solve the n-queens problem with Hill-Climbing algorithm","distinct":true,"url":"https://api.github.com/repos/gfrattaroli/Hill-Climbing-N-Queens/commits/0b14367fe55c7e1422fdb000f186cfb6d70bd0ac"}]}
{"actor":{"display_login":"gfrattaroli"}}