speed improvement by hashing evaluation components

Programming Topics (Computer Chess) and technical aspects as test techniques, book building, program tuning etc

Moderator: Andres Valverde

speed improvement by hashing evaluation components

Postby Uri Blass » 17 Dec 2005, 05:42

Movei evaluates every node because it is using the evaluation components later for pruning decisions.

I decided to save time by not calculating them before searching them in the hash tables.

It seems that it gives me 10-20% speed improvement that is not much and I wonder how much speed improvement you get by this idea(of course only programs that evaluate every node for pruning decisions can use that idea).

The main advantage is that changing the program to use that idea helped me to make the program more simple and to discover a bug but I am not sure if fixing the bug is really productive.

Uri
User avatar
Uri Blass
 
Posts: 727
Joined: 09 Oct 2004, 05:59
Location: Tel-Aviv

Return to Programming and Technical Discussions

Who is online

Users browsing this forum: No registered users and 33 guests