Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Your programs quiescence search behaviour?

Author: Antonio Dieguez

Date: 10:18:32 01/17/03

Go up one level in this thread


>>My program (at the moment) is doing the following with the above example I have
>>provided...
>>
>>1. Bxg5, NxG5 - Score= -8.99
>>
>>* At this point do you think my program should say "well, that was decisive, I
>>should return this score and search no further"?  Or is it important to search
>>other combinations in case it reveals other more important tactics?
>
>mmmh the alphabeta window would take care of a failhigh for white.
>You can certainly disregard the rest of the captures, eval+expected_gain<=alpha,
>that's futility.
>
>>2. Bxe4, Qxc1+, Q-d1, Qxd1, Kxd1  score= 0.14
>>3. Bxe4, Qxc1+, Q-d1, Qxb2  score= 0.94
>>4. Qxe4, Qxc1+, K-e2, Qxb2  score= 1.19
>>
>>After considering all the above combinations my qsearch returns the score of
>>-8.99, which looks correct to me.
>
>My program would do the same qsearch with minimax.

actually not... after Qxe4, there is Qxe4+ too in minimax... and even when using
alphabeta, it will be played as it checks the oponnent. May be I could do an
exception when there is only one capturing piece.



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.