Author: Dieter Buerssner
Date: 15:32:15 08/30/05
Go up one level in this thread
On August 30, 2005 at 17:45:32, Uri Blass wrote: >On August 30, 2005 at 12:46:11, J. Wesley Cleveland wrote: > >>On August 30, 2005 at 12:21:10, Gopikrishna wrote: >> >>>Gerbil creates opening book by hashing the position and comparing the hash >>>values. But tscp does by getting moves from structures and comparing it with >>>book lines. I guess this approach wont make it slow right? Is there any >>>difference in performance? Since I would like to decide on which way to go... >>>Thanks. >> >>The hashing method allows the program to find transpositions, which is generally >>good, but can have odd side effects. E.g 1. e4 e5 2. Nf3 Nc6 3. Ng1 Nb8 ?!?! > >odd side effects is not because of comparing hash values but because of trying >to use hash for tranpositions in not book positions. The same problem can also arise in positions, that are still in book. The problem can of course be solved. For example by storing moves in the book, not only positions. Regards, Dieter
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.