The cartoons are from José Diaz, some links:jkominek wrote: ↑Sat Sep 03, 2022 1:19 amI like his blog post, and have conducted a very similar experiment myself using fixed node counts (not including LC0) updated to Stockfish 15. My measurements reveal the same relationship between the NNUE and HCE curves, with HCE almost reaching NNUE at 256m nodes. I plan to push the node count over a billion to see how much the gap closes down under convergence. The notable conclusion is that the evaluation net does not gift Stockfish an appreciably higher asymptote. What it does dramatically accomplish is assist in finding good moves at a much much lower node count, hence time, even at a 2:1 nps ratio. The relationship of nodes/time vs. Elo is pushed leftward.Jouni wrote: ↑Fri Sep 02, 2022 3:34 pm There is interesting experiment https://www.melonimarco.it/en/2021/03/0 ... -of-nodes/ (no date). According to test SF reach practically max ELO 3500 after 10M nodes only. 1 second in modern CPU! After that only marginal gain.
Also worthwhile is his companion blog post. https://www.melonimarco.it/en/2021/10/0 ... ntium-90/
His rating list is notable for using classical time control of 40mv/120min (not seconds), and in anchoring the scale to human-computer matches. Included in his calibration pool are Rebel matches. Ed S. had the rare privilege of playing Anand back in the 90s.
https://www.rebel.nl/anand.htm.
Those were quite the distinctive cartoons, btw. I've long wondered what the background story is behind the Rebel cartoons.
https://www.rebel.nl/diaz.htm
https://www.chess.com/article/view/chess-verdict
https://www.chessprogramming.org/Cartoons
https://m.facebook.com/media/set/?set=a ... 405&type=3
