{"push_id":556132914,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9f71d1c6d42f78d1fcfd8f8c4d6e365873edf0e4","before":"c04cec183ddfe7550d2634f65510bf11ff2848e0","commits":[{"sha":"9f71d1c6d42f78d1fcfd8f8c4d6e365873edf0e4","author":{"email":"f3e795a83e54f319dd627642c96032e01e553951@gmail.com","name":"Ankan Banerjee"},"message":"promotions ordering and q-search + mobility\n\n- treat promotions as captures (to get better move ordering and better\nq-search). Treating check giving moves as captures in q-search is still\nTODO.\n- Add mobility eval. Use strategy similar to madchess to assign\nnon-linear weights to no of available move by each piece. Just counting\ntotal no of strictly legal moves seems to work almost as well though.\n- Fix important TT bug (garbage move object when TT entry isn't found).","distinct":true,"url":"https://api.github.com/repos/ankan-ban/chess_cpu/commits/9f71d1c6d42f78d1fcfd8f8c4d6e365873edf0e4"}]}