calling eval() at all depths in the search tree?

Discussion of chess software programming and technical issues.

Moderators: bob, hgm, Harvey Williamson

Forum rules
This textbox is used to restore diagrams posted with the [d] tag before the upgrade.
Post Reply
Posts: 56
Joined: Sat Nov 11, 2006 10:14 pm

Re: calling eval() at all depths in the search tree?

Post by yoshiharu » Thu May 06, 2010 8:34 am

Greg Strong wrote: Glad to see that someone else is doing this. Asside from Rebel, I didn't know of any other programs that attempted to perform a heavy eval at every node and try to make it pay off through use of the extra information it generates.
For what it's worth, there's also me with my engine ;-)
Anyways, when I was thinking to take it off (I already had a compile switch),
I was reinforced in the decision of keeping it instead by a post of Tord himself on this board, IIRC, that was pretty convincing.

For improving the speed, I use an evaluation cache, and I must say that the speed difference is very tiny.
Consider also that the number of internal nodes in normal search is dominated by the number of leaves/nodes-in-qsearch...

Cheers, Mauro

Post Reply