Author: leonid
Date: 03:43:49 09/12/99
Go up one level in this thread
On September 11, 1999 at 22:09:38, Bas Hamstra wrote: >HashTables are very important for movesorting. Best moves from previous searches >are in the hashtable. That way you can very much improve the probability that >you play the best move first, which is immensely important for the alpha-beta >scheme. When you search to ply n with hashtables you have to examine less nodes >than without, because of that. > >Estimates of how much less vary from 20% to 50%. In case of 50%, assuming using >nullmove, yes that is almost a ply. > > >Regards, >Bas Hamstra. Your message, and the one above, is more that useful. This is just moves ordering that still must be improved in my game and, after what I can see, hash table help even in this aspect. When I tryed my engin against the best one my "branching factor" was miserable. Now I work in improving it. With my respect, Leonid.
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.