Author: Christophe Theron
Date: 09:28:49 06/21/02
Go up one level in this thread
On June 21, 2002 at 06:53:41, Uri Blass wrote:
>On June 21, 2002 at 04:57:44, Russell Reagan wrote:
>
>>On June 21, 2002 at 04:38:04, Uri Blass wrote:
>>
>>>How much time does your program need to see that it is a draw?
>>
>>At least a few more weeks :)
>>
>>Russell
>
>It is an easy draw for the following reasons;
>
>
>1)White need always to move the knight by Nb3 N.. Nb3 N.. Nb3 N.. when the
>knight is never captured(the knight is never captured in b3 and we need to prove
>that the knight has a safe black square to go in order to prove that it is a
>draw).
>
>2)The black king cannot control a1 so the black bishop needs to be in the long
>diagnol in order to prevent a1 from the knight.
>
>3)The black bishop in the long diagnol can not control a5 so the black king
>needs to control that square.
>
>4)3 means that the black king cannot control c1 and d2 so the black bishop needs
>to control these squares but the black bishop must be in b2 in order to control
>both a1 and c1 and it does not control d2 from that square.
>
>I believe that even programmers with rating of 1500 can find that it is a draw
>and I wonder if one of them was smart enough to write the relevant code to
>explain it to the computer.
>
>Uri
The question is: will it make the program stronger?
I can easily see how it can make a program weaker by slowing it down, and I
seriously doubt it will increase the program's rating by a single elo point.
Maybe if the programmer in question is smart enough he will decide to ignore
this particular case.
Christophe
This page took 0.01 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.