Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: An extra bound?

Author: Robert Hyatt

Date: 11:18:47 09/10/99

Go up one level in this thread


On September 10, 1999 at 13:20:06, Steve Maughan wrote:

>>I see. I assume you only have the A/B bounds for getting the best move?
>>I use an extra bound so I always have a best move.
>
>Talk of an extra bound by someone like Ed Schroder is not something to pass over
>lightly!
>
>Any clues as to what this extra bound is?  If you want to find a best move from
>every ply then the only thing I can think of is to count the number of nodes
>required to refute each move.  The move that has the highest refutation count
>can be assumed to be reasonable, if not the best.  I believe Bob uses something
>similar to re-order at the the root after an iteration.
>
>Am I close?
>
>>
>>Ed


I don't think so.  I believe the 'extra bound' is just the 'best value' returned
by any search at a node where the value is still <= beta. So he has alpha and
beta (normal bounds) plus a 'gamma' that is < alpha that represents the best
guess of the real score for the best move...

I'm convinced it doesn't work (but this is already in another thread)...



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.