Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: An algorithm for KBN vs. K

Author: Reinhard Scharnagl

Date: 02:24:04 09/04/04

Go up one level in this thread


On September 03, 2004 at 18:49:27, Alessandro Scotti wrote:

>...
>So I have two questions now, the most important: how should this ending be
>played, exactly? Would it be useful (i.e. lead to a faster mate) to have say a
>two-stage code where we first gain the center of the board and then push the
>other king to the corner?
>...

May be I have a very different opinion to that, because I want to avoid to
manipulate the evaluation to fit for some special situation like K vs. KNB.
Though I am far away from being ready with that, I am working on an evaluation
function, which let the engine find its way to a positionally better situation.

I think that implementing such special programmed shortcuts and also a usage
of table bases are not helpful to improve evaluation functions, because they
mask out situations, where a positionally good evaluation function could show
its ability to find really good moves or to mate by its own.

Reinhard.







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.