Author: Uri Blass
Date: 09:14:35 08/26/05
Go up one level in this thread
On August 26, 2005 at 12:01:26, Andrew Shapira wrote: >Summary: People sometimes say that one uses a quiescence search to avoid horizon >problems. But a quiescence search alone will not do it. I am looking for some >guidance from the experts. > >Suppose we have the following position P1, with white (in capital letters) >to move. > > . . . . . . . k > . . . . . . . . > . . . . . . . . > p p . p p b . . > . . . . . . R . > . . . . . . . K > P P . P P . . . > . . . . . . . . > >In the line kh4 bxr kxr, white has an easy win, and white probably can win >easily if black replies to kh4 with any move other than bxr. > >Now suppose that a computer is playing white. The computer uses some standard >full width alpha-beta search algorithm with a quiescence search. Suppose that >the position P1 above is reached in the alpha-beta algorithm with 1 ply >remaining in the alpha-beta search, i.e., white makes a move and then goes to >quiescence search. > >So, white sees: > full-width search: > a4 > quiescence search: > bxa4 No bxa4 is not the first capture that it will search It will searvh first a4 BxR+ Uri
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.