{"push_id":1139548457,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"33021d06f1136c81a1be8e48b670b4ba29f46787","before":"5eebfe581641f1225560ed50dad42d19ae32e6bf","commits":[{"sha":"33021d06f1136c81a1be8e48b670b4ba29f46787","author":{"name":"Sebastien Montella","email":"2dde09ff23e8ecde02aeb8406696a2b37d299942@utbm.fr"},"message":"AI conception : Prolog - Move predicate\n\nMove predicate : pattern : Move( +L1, ? L2 ).\nL1 and L2 are two lists made of 4 elements each. The elements are the\ninteger that stand for the position of the player token into the\nBoardGame List. Example :\nMove( [ 0,5,9,21],X) means that the player has his chips on the Case 0,\nthe Case 5, the Case 9 and the Case 21. By writting the predicate like\nthis, it will try to unify X with all possible movement to be played by\nthe Player.","distinct":true,"url":"https://api.github.com/repos/magienseb/Teeko-BoardGame/commits/33021d06f1136c81a1be8e48b670b4ba29f46787"}]}
{"actor":{"display_login":"magienseb"}}