Author: James Robertson
Date: 22:35:31 10/26/98
Go up one level in this thread
On October 26, 1998 at 17:15:56, John Coffey wrote: >On October 26, 1998 at 02:10:37, vincent dichiacchio wrote: > >>my question is how programs deal with the possibility of a great non capture >>move in the middle of a series of captures in a quiescence search. if the >>quiescence score ignores that non capture, the score is faulty at best. >>vince > > >How is Q search any different from extending captures out? Could someone >please define Q search for me? > >John Coffey The q-search is just that; a minimax search that only evaluates capture moves (maybe also pawn pushes or check evasions). This is a major simplification, as there are several big differences from the normal minimax search. I am still trying to think of how to explain them....... um...... er..... can someone like Bob or Ernst help here? James
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.