Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Knight vs Bishop with pawns ending

Author: Howard Exner

Date: 11:26:12 01/11/99

Go up one level in this thread


On January 11, 1999 at 06:31:10, blass uri wrote:

>
>On January 11, 1999 at 05:18:58, Howard Exner wrote:
>
>>On January 10, 1999 at 11:25:14, Matthew Herman wrote:
>>
>>>I was using the epd from the position posted, not the game..
>>
>>Yes, that is what I posted to Michael Fitch, that you were using my epd
>>position.
>>
>>>I didn't say the
>>>knight COULDN't get to f6 but I said it would take some work..
>>
>>That's correct, sorry I used the word "couldn't".
>>Your quote is below ...
>>
>>"By the way .. in this position it isn't so easy to get the knight to f6 .. (the
>>Bishop goes to f5 and the k to e7 and it is really hard to penetrate from
>>there."
>>
>>>as obviously to
>>>get to a dark color square it most goto a light square and obviously the bishop
>>>might be able to stop that.. it probably wont be able to but it might..
>>>my
>>>contention is that it is NOT a piece of cake.. but it does take accurate moves.
>>
>>That is what I was hoping for in giving this position. That without deep
>>calculating, would some programs give themselves a head start on this position
>>by implementing knowledge of the strong knight vs weak bishop. Looks like
>>the author of Phallanx implementing such knowledge. Humans would glance at this
>>position and I think immediately assess that white has a comfortable edge.
>
>I found that all the programs that I tried gave white an advantage and not only
>Phallanx.

b5k1/7p/4p1pP/4P1P1/8/8/8/N5K1 w

How do some of your programs assess this position, say after 10 seconds?
If given a long search time programs will
perhaps find an exact winning line. But I'm curious as to what they
make of this position in the first few seconds. Just to see what knowledge they
have of this type of ending. By analogy consider the simple KNN vs K ending.
Programs without this knowledge (probably today no such program exists of
course) would flounder around with a big plus eval for the two knights.
Having the knowledge of the draw precludes the program from having to
calculate.

So my example calls for both a correct knowledge of good knight vs bad
bishop plus the obvious task of calculating.

without this drawing
>
>Uri



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.