Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Checks in the Qsearch

Author: Robert Hyatt

Date: 07:18:54 07/04/02

Go up one level in this thread


On July 04, 2002 at 04:05:11, Daniel Clausen wrote:

>On July 04, 2002 at 03:40:53, Uri Blass wrote:
>
>>On July 03, 2002 at 14:45:21, Robert Hyatt wrote:
>>
>>>I don't think programs 20 years from now will rely on "strong pruning"
>>>either.  KISS is a good principle when possible.
>
>That could be from a politician. Of course the real question here is when it's
>possible and when not.

It is a simple fact.   Which is better:

(1) searching to a depth of 16 plies by forward pruning so that most
branches only go to 12 plies;

(2) searching to a depth of 12 plies, but extending the important lines
so that they are searched to 16 plies.

See why forward pruning is not the _only_ way to solve this problem?  And
why it is not necessary to have forward pruning in your engine, without
worrying that you won't be as good as everybody that does.



>
>
>>Pruning does not mean not seeing everything
>>if you search deep enough and even today there are program that use
>>zunzwang detection.
>
>Ah, another politician. Please feel free to specify "deep enough". :)
>
>Sargon
>
>PS. Did you know that too much sugar is not healthy? Also unauthorized parking
>is forbidden. ;)



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.