TalkChess.com

The SMIRF website did not give discovered checks, did it? I thought it gave just checks, double checks and checkmates. I would not count castling checks, although there is one case where a castling check has the character of a discovered check, where you check with the Rook and attack something tha...

Mr. Hyatt, what do you think about FIXED TIME PER MOVE condition? I use it by now for several reasons, mostly because my engine has not any time management yet :lol: . Seriously, I am simply not interested in this one since at the present stage I care solely about search and evaluation improvements ...

perft(7): SubtreePerft SubtreeInnerNodes ---------------------------------------------------------------------------------- 01/20 Nb1-a3 120,142,144 5,064,713 1.63 s 3108.47 kN/s 02/20 Nb1-c3 148,527,161 5,952,936 3.51 s 3165.10 kN/s 03/20 Ng1-f3 147,678,554 5,967,223 5.39 s 3176.11 kN/s 04...

Yes, I definitely vote for this one. It looks like stolen from my header file ...
Filip

P.S. I remember reading the Hyperbola website a while back, maybee about some seven(?) years ago. I was starting with C and chess programming then and toying with some basic bit fiddling and assembler. I was taken with the idea but reversing bitboards or updating them during the make/unmake_move app...

Wow, you are really fast, thanks for reply ...
Now I see how it works, really simple and clever. It seems that reversed bitboards are not so much reversed actually
Filip

Please Gerd, could You be so kind and give me the definition of bswap(), or am I asking for too much ... ? Is it reversing bits or just only swaping bytes? Yes, I am too lazy to figure it myself ...
Thanks
Filip

Quick Perft (7) takes only 8.9 sec on my new Core 2 Duo machine (E6600, 2.4GHz)! 8-) It seems that I have got perhaps even little bit faster compilation of your Perft, on my Core2Duo T5500@1.66GHz it takes only 11.3 sec (by accident, my engine is exactly just as fast, but only in this particular po...

Hi, let me show my humble bunch of numbers ... All tests have been done without use of hashing (which I have not implemented in perft), however with hash keys as well as all other unnecessary data structures updated in make/unmake functions (they are the same as in the regular search). Only move eva...

Nr ONE is not solved by either Rybka nor Strelka, so it's obvious that there is some problem with Zugzwang. Nr TWO is solved by BOTH Rybka & Strelka, and that is really strange, because in fact it is the SAME Zugzwang problem, so far I only know engines which either solve BOTH or none of them. This...