Computer Chess Club Archives

Search

Messages

Subject: Programmers - need help with hashtable debugging

Author: Peter Kappler

Date: 23:40:10 05/26/99

Do any of you have any useful positions that you use for debugging your
hashtables?

I've been trying this one, which I think is pretty well known:

8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w - - bm Kb1;


Supposedly only Kb1 wins, but Grok likes Kb2.  After 21 plies, the score jumps
above +2 as Grok sees the f5 pawn dropping.

Genius 6 and Fritz 5.32 both like Kb1 and give it a winning score (+2.5 to +3.0)
immediately.

I've seen this problem posted often enough that I trust that Kb1 is the only
winning move.  So not only is Grok not finding the best move, but it seems to be
misevaluating Kb2.

Does anybody else have problems with this position?

Thanks,
Peter

• Re: Programmers - need help with hashtable debugging Dave Gomboc 00:16:58 05/27/99
  • Re: Programmers - need help with hashtable debugging Dave Gomboc 00:19:50 05/27/99
    • Re: Programmers - need help with hashtable debugging Robert Hyatt 05:12:33 05/27/99
      • Re: Programmers - need help with hashtable debugging Dave Gomboc 05:48:51 05/27/99
    • Re: Programmers - need help with hashtable debugging Jeremiah Penery 04:34:15 05/27/99
      • Re: Programmers - need help with hashtable debugging Dave Gomboc 04:47:21 05/27/99
• Re: Programmers - need help with hashtable debugging Dave Gomboc 00:16:46 05/27/99

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.