World Championship Winning Computer Chess Software Program & Downloads for Chess Databases, Analysis and Play on PC, Mac, iPad and iPhone — Visit: Hiarcs.com
Analyzing 1 M positions ( not very much) for 10 seconds (not much either) takes over 100 cpudays. Tony Huh, you put 100 CPUs to do the job and do it in one day? If a very popular website solicited the help of their users to the task, they'd help and the task would be done faster. I don't think so. ...
Maybe this is a stupid question, but is there some great impediment to a computing project that tries to develop the opening book? The fact that the problem is so embarrassingly parallelizable makes me think that it would be ideal for distributed computing. I'm sure that someone else must have thou...
So, pals, why number 1000 or in this case number 500 should be considered worthy of a price and not number 23 or number 11? I see in all this a biased behavior that calls for immediate action. I will you all in the court regards Fernando (my lawyer say we can close the caseright now if you offer me...
eval hash seems to be pointless as it could be incorporated into the normal hash using the same signature, if someone believed it was worthwhile. I am open to the possibility that an engine that does not hash qsearch nodes could get some gain from a separate eval hash. I can say that I use all thes...
I agree they are the two general purpose major advances although there are other ones that also offer extra Elo, like futility or even eliminating losing captures from the quiescence search. There are also many other search improvements which overlap with 1 & 2 and hence are much less effective...