Checks in Quiescent Search

Programming Topics (Computer Chess) and technical aspects as test techniques, book building, program tuning etc

Moderator: Andres Valverde

Checks in Quiescent Search

Postby Edsel Apostol » 30 Dec 2005, 07:12

Hi everyone,

How much Elo points a program could earn by generating checks in

quiescent search?

Edsel
User avatar
Edsel Apostol
 
Posts: 73
Joined: 01 Aug 2005, 05:27
Location: Antique, Philippines

Re: Checks in Quiescent Search

Postby Dann Corbit » 30 Dec 2005, 19:28

Gain in strength will depend on many factors (including what other sorts of extensions you are doing).

It is also possible to lose strength (for instance, if you do too many checks).
Dann Corbit
 

Re: Checks in Quiescent Search

Postby smcracraft » 18 Jan 2006, 21:31

Dann Corbit wrote:Gain in strength will depend on many factors (including what other sorts of extensions you are doing).

It is also possible to lose strength (for instance, if you do too many checks).


I believe Bob starts off his depth at 1.5 and increases by 0.75 for
each checking move that places the other side in check.

This controls potential quiescence check extension explosions.

I am thinking of switching to it.
smcracraft
 
Posts: 65
Joined: 15 Jan 2006, 05:38

Re: Checks in Quiescent Search

Postby Gian-Carlo Pascutto » 19 Jan 2006, 09:44

Crafty doesn't do checks in the qsearch.
Gian-Carlo Pascutto
 
Posts: 42
Joined: 04 Jul 2005, 13:24
Location: Belgium

Re: Checks in Quiescent Search

Postby Volker Böhm » 19 Jan 2006, 09:57

Hi,

I think from -20 to +20, depends on your engine and the way to implement it. For spike it was a not really measurable elo gain (5-10 Elo) to have checks in the first ply of q-search. Any more plys reduced the strenth.

Greetings Volker
Volker B?hm, Spike Team
Volker Böhm
 
Posts: 66
Joined: 27 Sep 2004, 18:52
Location: Germany

Re: Checks in Quiescent Search

Postby Uri Blass » 19 Jan 2006, 11:55

Volker B?hm wrote:Hi,

I think from -20 to +20, depends on your engine and the way to implement it. For spike it was a not really measurable elo gain (5-10 Elo) to have checks in the first ply of q-search. Any more plys reduced the strenth.

Greetings Volker


I think that it can be probably more than +20 but it is very hard to answer because there are tricks that work only if you have checks in the qsearch and if you remove checks in the qsearch and do not remove the tricks the comparison is not fair.

for example R for null move pruning.

Without checks in the qsearch constant as 3 may be too risky when with checks in the qsearch it is different.

Uri
User avatar
Uri Blass
 
Posts: 727
Joined: 09 Oct 2004, 05:59
Location: Tel-Aviv

Re: Checks in Quiescent Search

Postby L?szl? G?sp » 23 Jan 2006, 10:23

Edsel Apostol wrote:Hi everyone,

How much Elo points a program could earn by generating checks in

quiescent search?

Edsel


Hi Edsel,

I don't know it by ELO, but I can recall that Anthony Cozzie mentioned once, it is a must. I believe him :wink:.

Regards,
L?szl?
L?szl? G?sp
 

Re: Checks in Quiescent Search

Postby H.G.Muller » 23 Jan 2006, 11:52

You have to put some limit to it, though: if you generate checks in QS, you also would have to consider check-evasion in order not to score every check as a check-mate, and in some situations this explodes (e.g. in KQK).

A solution to this problem that I used in 1981, and seemed to work quite well, was only allow one check with the same piece in a row, unless the second check is a capture (in that case the move was considered because it was a capture, not because it was a check; other captures with the checking piece would also be considered in QS). If two different pieces were involved in giving a series of checks, this usually led to a quick check-mate.
User avatar
H.G.Muller
 
Posts: 3453
Joined: 16 Nov 2005, 12:02
Location: Diemen, NL


Return to Programming and Technical Discussions

Who is online

Users browsing this forum: No registered users and 4 guests