Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Problem with draws by rep and hash table

Author: Bruce Moreland

Date: 09:17:01 10/08/99

Go up one level in this thread


On October 08, 1999 at 04:30:12, Peter McKenzie wrote:

>On October 08, 1999 at 03:06:56, Bruce Moreland wrote:
>>2) Score a position as drawn if it has happened twice in the game continuation
>>and/or once somewhere directly above in the search tree.
>
>I think this is equivalent to saying that nodes very close to the root of the
>search tree should be treated a little differently (because it is impossible to
>repeat one of those positions further up the search tree).

No, what I'm saying isn't that general.  It's a way of seperating repetitions
into two categories:

1) Two reps in search.  Making it find three in search is too much, it will miss
a lot of draws, I expect.

2) A rep with a move in the actual game continuation.  These reps are less
meaningful since your opponent has something to say about creating them, and the
problem I discussed later in my post comes up.

bruce



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.