Author: David Blackman
Date: 02:26:31 04/27/99
Go up one level in this thread
On April 27, 1999 at 02:37:38, Pham Hong Nguyen wrote: > >I am trying to build a simple chess program. I use hash table following the >lecture ?Strategy and board game programming? of UCI. Element of hash table is >defined: > [ cut ] >I hope that it would save time as much as some one reported about 90%. But it >has saved only 30% at 7 ply (with quiescence search). This is not too unusual for the middle game. It sometimes gets better than this in the endgame, especially with king and pawns only, and all the pawns locked together. The hash table can also help in other ways. For instance if you do aspiration windows the hash table can save a lot of work if you fail high or low and have to search a second time. If you think on your opponents time, even if you guessed wrong about your opponent's move, the hash table will have some useful infomation in it. You can store the best known move for the position in the hash table. This can help with move ordering if you have to search the same position later to a greater depth. I think this effect on move ordering is likely the biggest benefit of hash tables in the midlle game.
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.