TalkChess.com

I I understood most part of the code except this lines (appearing twice in generate_rank_attack): if ((o & b) == b) break; What is the use of the above if loop conditional? Many Thanks, Kalyan The purpose of this code is to generate an attack mask containing empty squares and the first occupied squ...

This is scary. Does others engines exhibit such lower EG values ? For Amoeba, pawn, rook, bishop pair and material imbalance have significantly stronger values during the endgame phase. knight and bishop keep about the same value and the queen is slightly stronger. However, Amoeba's evaluation func...

The latest CCRL Rating Lists and Statistics are available for viewing from the following links : http://ccrl.chessdom.com/ccrl/404 (40/4) 40/4 testing since the last update report has included (thanks to Gabor and Tirsa): Amoeba 3.0 64-bit Thank you for running all those games with Amoeba. I hope t...

These are the counts I get per move at depth 4, maybe it helps. g2h3: 381 d5e6: 436 e5g6: 495 e5d7: 642 e5f7: 475 e2a6: 343 f3h3: 397 f3f6: 521 Maybe somebody else can verify these numbers. I think the difference is due to the fact that you don't generate check-evasions, because check-evasions will...

The following 8-piece endgame just arose in a Raubfisch X40a3-Cfish match: [d]4b3/8/6k1/6p1/p6p/K3B1P1/8/8 w 01 Virtually all humans immediately see that this is a draw. A simple variation of the above position: [d]4b3/8/2p3k1/2K3p1/7p/4B1P1/8/8 w - - 0 1 Here it is a black win. I just move a pawn ...

One should remember that the design goal of engines is in general not to be good at chess, but just to have a high Elo. If worse programs score better in games, it is preferred to make them worse. I have some trouble to understand you, to be good at chess IS to have a high Elo . In the case of oppo...

In Amoeba the opposite bishop code made my program weaker by a few Elo.

Once I counted when and how games terminate in case of
- a random mover:

- a mate-in-1 mover:

The Prefetch() instruction can be used to speed up the read operation for hash table probes. My tests indicate a speed improvement for one CPU using Prefetch(), but increasing threads decrease the effectiveness of Prefetch(). What is happening? I do not know what is happening, but I do observe a si...

One aspect of the uci protocol I am not 100% sure about is seldepth. How do you calculate this? Is it the maximum depth qsearch has reached? In Amoeba, I compute it as the maximum depth reached in qsearch. Side question: should the depth we send in info string should be the iterative deepening dept...