TalkChess.com

Thank you guys. That is funny
Does this mean that they cannot think any further than that number of nodes? I have checked all moves and there is no move with a greater number of nodes than 2147.5 millions.

All the games can of course be found in the Archive page and downloaded from there: http://tcec.chessdom.com/archive.php In the game Scorpio-Crafty, one can see that for most moves, both engines reached exactly 2147.5 M nodes and then made their move instantly. Is that a coincidence, a bug or somet...

I think that the following idea may be productive about testing new engines with a framework: 1)Decide that every person who give patches can buy computer time and pay 100$ for 1,000,000 standard minutes of computer time on 1 core with priority 0. Generally the price can be 100*(2^n)$ for 1,000,000...

So between the times of 16 seconds and 33 seconds, the most cutting edge Stockfish is considering a move that an IM would discard out of hand? How is this an effective analysis engine unless you're prepared to really sit there for a long time ... on every move? I'd rather trust a +3000 elo engine t...

I don't understand that time notation; how long does it take Stockfish to prefer 17..Ne6? The time is in ms. On my "old" hardware (Intel duo core E6300 at 1.86 Ghz) it took 131 seconds which is slightly more than 2 minutes. This means less than 35 seconds for modern pc's I guess. Note that the non-...

Stockfish 250214 with 5 pieces syzygy would play Ne6 at depth 28 but h5 at prior depths. info depth 27 seldepth 40 score cp -98 nodes 99978982 nps 1822073 tbhits 2 time 54871 multipv 1 pv h7h5 g5e6 f7e6 f1d3 g8f7 g2g3 e8d6 e1e2 a8c8 h1a1 c8a8 f2f3 a8d8 a1c1 d8a8 f3f4 info depth 28 currmove h7h5 curr...

I do not agree with marco (the leader of stockfish) about a lot of things and one of the problems is that he seems to be too careful not to lose elo and even reject simplifications that are not proved to be bad because of unproved fear that they are 1 elo loss. I wonder if it is possible to have a ...