Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Which programs can solve Queen vrs Rook without Nalimov tablebases?

Author: Christophe Theron

Date: 13:22:57 06/01/02

Go up one level in this thread


On June 01, 2002 at 11:16:44, Robert Hyatt wrote:

>On June 01, 2002 at 06:23:34, Gian-Carlo Pascutto wrote:
>
>>On June 01, 2002 at 00:12:53, Robert Hyatt wrote:
>>
>>>Give crafty 1 second per move.  It solves it easily.  I discovered this
>>>a few years ago when talking about the 4 piece files.  This is hard for
>>>humans.  It is _very_ easy for computers.  Far easier than I would have
>>>thought possible...
>>
>>Hmm, I just tested and mine can't do it at 1 sec per move,
>>so I guess you do need some kind of 'mopping up' code.
>>
>>--
>>GCP
>
>
>Yes.  All you really need is code to (a) drive the losing king to the
>edge of the board and (b) get the winning king close to the losing king
>to threaten mate.  The search will see how to prevent the rook checks and
>eventually by threatening mate it will win the rook...


I think Tiger has both heuristics and that's why it manages to win, but that's
only by chance.

Actually these heuristics are always activated in the late endgame as I noticed
it was useful so often.

I did not know they were also working in KQKR and that nothing else was needed.



    Christophe



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.