Author: Bernhard Bauer
Date: 07:51:59 12/18/00
Go up one level in this thread
On December 18, 2000 at 07:08:38, Tim Foden wrote: >Hi All, > >I have recently been looking at lots of old posts (I've been mucking around >with my own archive browser with better search functionality), and I keep >coming across the FINE 70 position as a good test for a hash implementation. > >I have been worried about the hash code in GLC for a while now, but I haven't >been able to track anything down that is wrong. I'm not sure there _is_ >even anything wrong. > >Are there any other (simpler... where I can dump the tree an look at it >myself) positions that also test the hash table in this way? > You may try F. Sackmann, matt in 25 Zuegen, 1.Kf5 8/8/2p/k1p1K/p1P/P/8/8 w J. Awerbach 8/1k/p/p2p2K/P2P/8/8/8 w J. Awerbach 6k/3p/3p/3P/4P1p/6P/8/K w These 3 positions are very similar fine70 as they are solved by the method of coresponding squares. Kind regards Bernhard
This page took 0.01 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.