Author: James Robertson
Date: 10:03:51 02/25/99
Go up one level in this thread
On February 25, 1999 at 00:44:28, Jeremiah Penery wrote: >On February 25, 1999 at 00:27:58, Jeremiah Penery wrote: > >>On February 24, 1999 at 23:55:26, James Robertson wrote: >> >>>On February 24, 1999 at 04:48:50, Ulrich Tuerke wrote: >>> >>>> >>>>On February 24, 1999 at 04:36:47, Ulrich Tuerke wrote: >>>> >>>>I use the 2 positions below to test correct work of my hash algos. You need >>>>correctly working hash to solve this. May be they are useful for you. >>>> >>>>8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w - - 0 1 id "HASH-01";c0 "Only Kb1! wins"; >>>>8/1p5k/1P1p4/3p4/3Pp2p/2K1P2p/7P/8 w - - 0 1 id "HASH-02";c0 "Kb2! draws"; >>> >>>I cannot solve either in a reasonable time with or without hash tables. :( >>>For the second position, I solve at ply 21 after more than a minute of thinking. >>>There is is probably some big bug in my search that doesn't have to do with hash >>>tables, as it seems that William Bryant was able to solve at ply 13. This is >>>distressing (not his success, but my failure). :( >>> >>>James > >Solving at ply 21 isn't that bad...It's the time that's the problem. Crafty >solves the second position at ply 18, but it only takes .17 seconds to do. >Unfortunately I could not test it with your program - when I try to test an EPD >file, Windows generates some kind of error. :( > >Jeremiah Yeah... it's trying to use space for the rep list that hasn't been allocated. I have since fixed this bug. James
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.