Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: question for programmers

Author: Sune Fischer

Date: 15:04:22 07/24/02

Go up one level in this thread


On July 24, 2002 at 17:53:26, Russell Reagan wrote:

>On July 24, 2002 at 14:27:05, Slater Wold wrote:
>
>>Think it's called knowledge.  ;)
>>
>>Oh, and a damn good preprocessor.
>
>Knowledge isn't going to decrease your branching factor. Without some kind of
>pruning you're not going to be able to get the low branching factor that they
>get, right?
>
>Maybe I misunderstand what a preprocessor does. As I understand it, it changes
>how the engine evaluates the position based on what kind of position it is. So a
>closed position might be evaluated differently than an open position, right?
>
>Tiger may not use null-move to a high degree, but Christophe is on record as
>saying that it does do pruning using his own methods. I'm just curious if Rebel
>and Junior do pruning, or if it's possible to create that strong of an engine
>without pruning.

You can create a strong engine without pruning, but you won't get a top engine
without it I think.
Once you get yours going, try and print out a few random positions from the
search, see the kind of crap that gets searched.
It will be all too obvious a lot can be pruned, for instance at ply 3 from the
initial position, my engine likes to take its king out for a walk! ;D

The problem is to find the rules to it "safely".

-S.




>Russell



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.