Author: Guillem Barnolas
Date: 11:43:32 11/25/98
Go up one level in this thread
On November 21, 1998 at 19:01:49, Robert Hyatt wrote: >On November 21, 1998 at 17:53:25, Guillem Barnolas wrote: > >> >>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. > > >It's important for reducing the size of the tree, as you suspect,not for >increasing the NPS. In the opening/middlegame it is not critical. In >late middlegame and endgame positions you will get many more plies if this >is done right... Well, Thanks, it is what I supposed... I think I might get it to play decently first... have to make a good interface too... lots of things... thanks...
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.