2 ms·
Looking at the recent patches[1] for Stockfish it seems like a rather true statement? Most of the patches are related to how it evaluates a position; not how it
by judofyr 8y ago
Looking at the recent patches[1] for Stockfish it seems like a rather true statement? Most of the patches are related to how it evaluates a position; not how it prunes/searches the tree of possible moves.
Here's one random test which showed improvement: https://github.com/Vizvezdenec/Stockfish/compare/5c2fbcd...51e1b4b https://github.com/Vizvezdenec/Stockfish/compare/5c2fbcd...5...
Bitboard b1 = double_pawn_attacks_bb<Them>(nonPawnEnemies) & b & attackedBy[Us][PAWN];
score += make_score(90, 72) * popcount(b1);
And look at all of the magic numbers and logic in evaluate.cpp: https://github.com/official-stockfish/Stockfish/blob/master/src/evaluate.cpp https://github.com/official-stockfish/Stockfish/blob/master/...
[1]: http://tests.stockfishchess.org/tests http://tests.stockfishchess.org/tests
- antirez 8y agoPosition evaluation is very unlike to the article statement, where it looks like actual game dynamics are taken into account one after the other in order to make the engine stronger. Instead still traditional engines mostly rely on brute force. So a reader not aware of those things will have a wrong picture in her/his mind.