Author: Uri Blass
Date: 02:28:45 10/12/03
Go up one level in this thread
On October 12, 2003 at 00:16:41, Peter Stayne wrote: >I take the lack of responses to mean the answer to my question is no. :) I remember that smarthink solved it from previous discussion. The author was not sure if it solved it for the right reason. Engines that do not consider underpromotions like Aristarch or Tao have no problem to find the right move. > >Anyways, is that a position that could possibly be solved by increased >positional knowledge by an engine author? Or would any engine have to reach such >a high ply to arrive at the winning line. I think that it can be solved by better search rules. 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.