{"push_id":927395587,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"50001dff2b271c3a3bed71b2634e96383fcb7194","before":"39892bb4bb5b5c445f73e9a42674169f559a46bb","commits":[{"sha":"9893cd2c489af8cb6bf8111bc527d3419e0a5284","author":{"email":"4b1bae11f1777a912b0957c30f951f323deff558@gmail.com","name":"lucasart"},"message":"Restore KRKB and KRKB\n\nNot strong enough to pass, but consistently positive at depth=10, no syzygy, no\nadjudication:\n\nendgame vs master: 16469 - 16266 - 26635  [0.502] 59370\n\nbench 6758368","distinct":true,"url":"https://api.github.com/repos/lucasart/Stockfish/commits/9893cd2c489af8cb6bf8111bc527d3419e0a5284"},{"sha":"50001dff2b271c3a3bed71b2634e96383fcb7194","author":{"email":"4b1bae11f1777a912b0957c30f951f323deff558@gmail.com","name":"lucasart"},"message":"Get rid of RootNode template\n\nThere is no reason to compile 3 different copies of search(). PV nodes are on\nthe cold path, so there is no cost in computing:\n\nconst bool RootNode = PvNode && (ss-1)->ply == 0;\n\nInstead there may be a tiny performance benefit in reducing frequently used\ncode, hence improving cache performance:\n\n              nps    +/-\ntest    2,399,043  4,080\nmaster  2,392,368  3,493\ndiff        6,675  3,571\n\nAnd this simplifies code a tiny bit as well.\n\nNo functional change.","distinct":true,"url":"https://api.github.com/repos/lucasart/Stockfish/commits/50001dff2b271c3a3bed71b2634e96383fcb7194"}]}