Author: Uri Blass
Date: 12:04:42 05/27/01
Go up one level in this thread
On May 27, 2001 at 12:57:57, Rafael Andrist wrote: >Why sould this position be difficult? The move Kb1 is practically forced. My >program finds Kb1 immediately and at ply 18 it sees that White can at least >equalize. Its clear that it does not see the mate, because it is too far away. The test is not to find Kb1 but to win the game. Can your program win the game with white. I suspect that it is going to do a draw by repetition by 1.Kb1 e3 2.Bd8 Kb8 3.Bc7+ Ka8 4.Bd8 Kb8 5.Bc7+ Ka8 If it cannot avoid 3.Bc7+ or 5.Bc7+ then I do not consider the position solved. The hard test is to find Be7 in the following position. [D]k1b5/1pBp1p1p/1P1PpP2/1p4P1/8/4p3/1p2P3/bK6 w - - 0 1 Be7 is a simple draw but for some reason programs prefer check. I believe that the problem can be solved practically if the evaluation function of the program gives a bigger score for a longer draw. It is going to push it to try longer lines that lead to a draw and it can push it to find the right moves. 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.