Author: Guillem Barnolas
Date: 14:53:25 11/21/98
I'm thinking on implementing a hash table in my program, but I'm thinking that it might cost a lot to do it for the speed increment you get... how faster it becomes ???.. have you made any comparisson in your programs, before and after having the hash table.. I suppose it's not nps faster but in plies, as it evaluates less nodes... I like any suggestion... Greets, Guillem.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.