Author: Bob Durrett
Date: 05:39:17 08/29/03
Go up one level in this thread
On August 29, 2003 at 07:28:57, Joost Buijs wrote: >On August 28, 2003 at 21:26:25, Robin Smith wrote: > >>On August 28, 2003 at 10:49:06, Joost Buijs wrote: >> >>>Normally how bigger the hastable the better it is. >>>However, the problem is that the hashtable has to be ajusted or cleared >>>inbetween moves, if the table gets very big this will cost noticeable time. >>>If you play games from lets say 3 mins/game you have on average 2 or 3 >>>secs/move. If clearing your table takes a big part of this it can easely >>>degradate performance. >> >>Most programs no longer clear hashtables between moves. Why throw away >>information? > >I think it is a matter of taste. My program performs about equal with or without >clearing the tables. Without clearing I had some nasty problems, specially in >the endgame. Thats why I still clear the tables between moves. > >> >>Robin I believe the way the engine is being used has a lot to do with whether or not the hash table should be cleared between moves. (1) Playing a game: Maybe in this case it might make sense to clear the hash table between moves, but I don't see why. (2) Post-mortem Analysis: There is more than one way to do analysis. One way to do post-mortem analysis of a game is to start with the last move, analyze it, and then move to the next-to-last move and analyze it, progressing in this way through the game until reaching the first move. In case (2) it seems that there would be much to gain by NOT clearing the hash tables between moves. This assumes, of course, that the engine programming was done properly. Bob D.
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.