Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Checks in the Qsearch

Author: Uri Blass

Date: 13:18:16 06/29/02

Go up one level in this thread


On June 28, 2002 at 17:54:56, Keith Evans wrote:

>On June 28, 2002 at 16:33:10, Scott Gasch wrote:
>
>>Another idea that I read from was that generating non-capturing checks in the
>>qsearch against a side that has had a chance to stand pat already is a waste.  I
>>really don't understand this idea and disagree with it.  Imagine black has had
>>an oppertunity to stand pat but instead plays RxN (N appears hung).  Well this
>>looks really good unless white then generates Qd4+ forking blacks R and K and
>>winning the R.  If you neglect to generate checks on a side who has already had
>>the chance to stand pat you let him get away with RxN and like it.  If the only
>>reason to add checks to the qsearch is to find mates then I agree -- checking
>>after a side could stand pat is wasted.  But if the goal is to improve tactical
>>play then I think this idea is not sound.
>
>I'll be very interested to see what responses this generates. Hsu took the time
>to design and implement special logic to help generate checking and check
>evasion moves in Deep Blue which I assume was used in qsearch. This was not a
>trivial undertaking - it adds both additional logic and additional interconnect.
>He probably had a good reason for doing it, since he could have used that time
>for something else like implementing a small hash table.

How do you know what hsu did and what he could do?

I do not know and I do not assume that people do the best things that they could
do.

I believe that there are ideas that can do programs 50 elo better with little
work and they are not used by programmers only for the simple fact that the
programmers did not think about them or did not evaluate them correctly.

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.