Author: Mogens Larsen
Date: 15:29:14 06/22/00
Go up one level in this thread
On June 22, 2000 at 17:59:27, Robert Hyatt wrote: >Remember the tree. If I play Nf3, you play e6, I play Ng5, I reach the same >position as if I play Na3, you play e6, I play Ng5. Totally different first >move, totally identical final position. The hit (hash) after Ng5 works no >matter which move is searched first. Okay, now I get it. >It does that. But at reasonable time controls, the hash table gets overwritten >many times during a single search. Remember that I search about 1M nodes per >second. that is 300M in 5 minutes. at 16 bytes per entry, that would require >4.8 gigs of RAM. Very few have that much RAM for hashing. :) If you cut >that by a factor of 10, then the tree is 10x bigger than hash. Overwrite city. Yes, that is very obvious, should have been able to make that deduction :o(. In reality it doesn't matter how much you squeeze :o). Thank you answering my nitwit questions. Best wishes... Mogens
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.