1,520 karma · joined May 13, 2013
I suppose it makes sense, given: 1) popcount is very common in bit-manipulating programs, 2) there is no standard popcount in ISO C, 3) it potentially saves 100+ instructions.
(Edit: I see a comment on Lemire's blog already points to that.)
[1] https://graphics.stanford.edu/~seander/bithacks.html
[2] http://www.eecs.berkeley.edu/~sseshia/pubdir/synth-icse10.pd...
http://www.npr.org/sections/thetwo-way/2015/07/21/424980378/...
[1] https://www.cia.gov/library/publications/the-world-factbook/...
Edit: had a comment about previous performance, but I had mistaken CloudScale for one of their competitors, woops.
[1] http://www.wolframalpha.com/input/?i=32.22+km^3+%2F+296*10^6...
This is very impressive work considering it's a master's thesis (meaning it was done in a short period of time, not that master's students aren't capable of producing top-quality work), but: 1) applying learning/tuning to position evaluators is not new (the network is deeper than usual, though it also uses features that are known to be useful, and doesn't rediscover everything), 2) the rating gap when compared to state-of-the-art engines is absolutely massive (contrary to the article's claim that it is competitive). Giraffe is a great project and it is better than almost all humans, but it doesn't seem (yet!) to be a revolution in computer chess.