Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Deep endgame problems

Author: Dann Corbit

Date: 10:53:17 10/18/99

Go up one level in this thread


On October 18, 1999 at 10:50:39, Bas Hamstra wrote:

>There are several endgame positions in the wac testsuite that my program takes
>many seconds to solve. I saw Crafty solves some of those instantly (an old
>Crafty, without tb).
>
>How does Crafty do that? I tried to use various promotion extension schemes (eg
>pushes of freepawns), but they are not of much help.
>
>Is it just square of the pawn (sotp) endgame eval stuff? I don't have it.
>Because I thought in most endgames there are more than only a few pawns and 2
>kings, and then things get too complicated. When there is for example a knight
>somewhere this sotp code would be useless, no? Or at least very complicated.
>
>How much would this sotp eval help the average endgame when there are also a few
>minor pieces on the board?
>
>And are there more tricks to see guaranteed wins quick other than tb?
Rename the learning file and try it again.  It may be that crafty has seen this
position before and tagged it.

Since the source for crafty is published, you could just trace the eval function
and see what is going on.



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.