Computer Chess Club Archives

Search

Messages

Subject: Re: Help needed: How can I search a 6 piece position by Nalimov tablebases?

Author: Uri Blass

Date: 12:59:26 12/04/04

Go up one level in this thread

On December 04, 2004 at 14:03:23, Tansel Turgut wrote:

>bishop + rook pawn is not able to win, if black can give his knight for the c
>pawn.
>Tansel

Dieter's comment is about the following sentence of you:

"The computer programs give high evaluations for white, but they don't
understand the bishops of opposite colors."

There is only one bishop so there are not bishops with opposite colors.

I guess that you meant to say that they don't understand the opposite colours of
the bishop and the queening square of the rook pawn.

Uri

• Re: Help needed: How can I search a 6 piece position by Nalimov tablebases? Tansel Turgut 13:04:45 12/04/04
  • Re: Help needed: How can I search a 6 piece position by Nalimov tablebases? Dieter Buerssner 16:53:09 12/04/04
    • Re: Help needed: How can I search a 6 piece position by Nalimov tablebases? Vasik Rajlich 03:15:51 12/05/04
      • Re: Help needed: How can I search a 6 piece position by Nalimov tablebases? Uri Blass 04:05:36 12/05/04

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.