Author: Chris Whittington
Date: 01:44:53 11/24/97
Go up one level in this thread
On November 24, 1997 at 01:35:38, Komputer Korner wrote: >Now that we have your word that everyone uses some sort of replacement >strategy when the hash table fills up, doesn't this mean that Chris >Whittington's description of the program acting like a drunken sailor >when the hash table is filled, a bit of an inaccuracy, thus the results >of the Korrespondence Kup are valid? No it doesn't and no it doesn't. Korner, imagine your bath tub, full of water. You want to put something in it, possibly yourself. But it can't take being full of water plus your volume as well. So when you get in, a load of water has to be displaced out, no ? So you put in the new information at the cost of the old information, yes ? When you need the old information it's not there, yes ? Eureka ! Chris Whittington >On November 21, 1997 at 12:34:26, Robert Hyatt wrote: > >>On November 21, 1997 at 11:06:15, mike cooter wrote: >> >>>In Fritz 5 when I set it up to think on infinite level, once my >>>hashtables fills up to100 percent, is the computer still thinking on >>>what is the best move? If it is, then what is the hash tables for? >> >>they are used to speed up the search. However everyone uses some sort >>of replacement strategy when the table fills up, so that it continues to >>help the search, although at a somewhat reduced effectiveness...
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.