Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: High NPS vs. Low NPS

Author: Aaron Tay

Date: 08:58:18 11/26/01

Go up one level in this thread



Hello Steve and the rest

Some questions if you don't mind

n November 26, 2001 at 06:26:52, Steve Maughan wrote:

>The answer lies in the structure of the programs and the evaluation functions.

I was wondering is this somewhat related to the idea that some programs are
considered preprocessors and others are not? Or is it a totally different
concept?

>The King aka ChessMaster evaluates the control of each square on the board.
>This information is useful for guiding the search and using in the evaluation
>function however it's expensive to compute.  You can also see this with Phalanx
>which can triggers a deaper search from within the evaluation function - i.e.
>the evaluation says that the position is not stable so search another ply
>deeper.

Hmm this is in constract to the normal quienscience search?

>In contrast you can get some programs (Goliath) that use a piece-table
>evaluation and rely on Null Move and some simpler extensions to get by.  These
>are fast - it's probably not fair to say they are dump since they get their
>knowledge from the seach.  Just a different way of "skinning the cat".
>
>Regards,
>
>Steve


Thank you.

Aaron



This page took 0.05 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.