Search found 16820 matches

by bob
Tue May 29, 2007 3:18 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Speedup with bitboards on 64-bit CPUs
Replies: 49
Views: 36395

Re: Speedup with bitboards on 64-bit CPUs

Hello, If I understand it correctly, Crafty generates and tries captures before noncaptures in the main search, so if those moves cause cutoffs, the normal moves won't have to be generated at all. QS isn't the only place for savings. The arithmetic seems like this:- for every fail high node, there ...
by bob
Tue May 29, 2007 3:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Speedup with bitboards on 64-bit CPUs
Replies: 49
Views: 36395

Re: Speedup with bitboards on 64-bit CPUs

Hello, But once again, in the hope that one day it will sink in, .... Vasik Rajlich has become sort of Jesus Christ in computer chess, Osipov has become sort of Son of Jesus Christ in computer chess and Sergei Markoff is very like St. Peter...If after the appearance of sort of Messiah preaching the...
by bob
Tue May 29, 2007 3:12 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: First fail high drops in endgame
Replies: 20
Views: 10378

Re: First fail high drops in endgame

Did you ever measure this quantity before (with different result)? It seems normal to me that it is more difficult to find cut-moves in an end-game, as the information that distinguishes the winning from the losing moves is much more distant. In the middle game it is often decided by what is on the...
by bob
Tue May 29, 2007 3:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: First fail high drops in endgame
Replies: 20
Views: 10378

Re: First fail high drops in endgame

Hi all, I think I broke something in my engine, but I'm not sure what. Maybe someone has a clue. When I go towards the endgame, the percentage first fail high drops to below 80% ( normally above 90%) I'm not sure how to test/ where to look. I switched off bitbases (thought they were corrupt), switc...
by bob
Sun May 27, 2007 9:49 pm
Forum: Computer Chess Club: General Topics
Topic: Participants WCCC 2007
Replies: 108
Views: 49420

Re: Participants WCCC 2007

http://www.grappa.univ-lille3.fr/icga/tournament.php?id=173&lang=6 Now we are already 10. Another big iron - puhh GridChess by Kai Himstedt and Ulf Lorenz Thomas Gaksch Toga parts Fabien Letouzey Fruit parts Robert Hyatt Crafty parts No idea whether the Sleep In still exist, but no need to take an ...
by bob
Sun May 27, 2007 9:41 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Speedup with bitboards on 64-bit CPUs
Replies: 49
Views: 36395

Re: Speedup with bitboards on 64-bit CPUs

[This is far faster at a K7 than crafty at a 64 bits chip. Vincent Ofcourse, you can say anything you want because we have no way of testing Crafty against your engine. May be you and Hyatt should do a 100 game online match at ICC at a decent time control. The statement makes no sense. That implies...
by bob
Sun May 27, 2007 2:50 pm
Forum: Computer Chess Club: General Topics
Topic: Participants WCCC 2007
Replies: 108
Views: 49420

Re: Participants WCCC 2007

http://www.grappa.univ-lille3.fr/icga/tournament.php?id=173&lang=6 Now we are already 10. Another big iron - puhh GridChess by Kai Himstedt and Ulf Lorenz Thomas Gaksch Toga parts Fabien Letouzey Fruit parts Robert Hyatt Crafty parts No idea whether the Sleep In still exist, but no need to take an ...
by bob
Sun May 27, 2007 2:48 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: question about symmertic evaluation
Replies: 37
Views: 21929

Re: question about symmertic evaluation

Actually my 1.7M was using one core. And no, I don't divide at every node, but I do divide at most of 'em (at every call to Evaluate() but not at non-qsearch internal nodes). However, if you round my NPS up to 2M, that is 1usec/node, but in the core2, that is 1000nsec/node, which is certainly somet...
by bob
Sat May 26, 2007 5:25 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: question about symmertic evaluation
Replies: 37
Views: 21929

Re: question about symmertic evaluation

OK, here's the results. I added an x = y / z; type operation at the very top of Evaluate(). the values were all global, and y and z are changed so that the compiler can't play any hanky-panky with getting rid of them and replacing the divide with a constant. I also use the value elsewhere so that it...
by bob
Sat May 26, 2007 5:08 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: question about symmertic evaluation
Replies: 37
Views: 21929

Re: question about symmertic evaluation

I don't think so. I am searching about 1.7M nps on my core-2 duo at 2.0ghz. I guess I could use the hardware counters to count the number of instructions, but it has to be way more than 1000 instructions per node. Last time I did use hardware it was around 2700 instructions per node but that was pr...