Author: Alessandro Damiani
Date: 00:10:51 10/31/99
Go up one level in this thread
On October 30, 1999 at 22:47:21, Bruce Moreland wrote:
>On October 30, 1999 at 21:47:54, Robert Hyatt wrote:
>
>>On October 30, 1999 at 20:48:19, Dave Gomboc wrote:
>
>>>Do you remember the ACC volume? I have a stack of them in my office at school,
>>>and I will be there on Sunday. Maybe I can just flip through them...
>>>
>>>Dave
>>
>>
>>I am not sure. I have a 'review' copy that I was asked to proofread. And I
>>think the one I reviewed went into one of the Advances in Computer Chess
>>books that Beal used to edit after the Advances in Computer Chess conference
>>he would orgranize on a regular basis.
>>
>>I'll try to sort thru everything monday and find a real citation for it that
>>you can find...
>
>Advances in Computer Chess 5.
>
>bruce
The title is "Experiments with the null move", page 65. The basic quiescence
search algorithm is:
QUIESCE (lower, upper) integer lower, upper;
{
integer bestv;
makenull; bestv <- -evaluate(-upper, -lower); unmakenull;
foreach move m do
{
if (bestv>=upper) return (bestv);
make(m); v <- -QUIESCE(-upper, -bestv); unmake(m);
if (v>bestv) bestv <- v;
}
}
where the function evaluate could again be a second QUIESCE. Beal writes about a
quiescence search made of
- QUIESCE1 with "evaluate" = material balance, searching only captures
- QUIESCE2 with "evaluate" = QUIESCE1, searching tactical moves (threats too)
Alessandro
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.