Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hard study for computer

Author: Uri Blass

Date: 14:42:59 10/01/03

Go up one level in this thread


On October 01, 2003 at 17:35:40, Thomas Mayer wrote:

>Hi Pierre,
>
>[D]8/k3P3/p3K2n/1n3p2/1N4b1/1P1p1p2/8/4B3 w - - 0 1
>
>like mentioned in the threat - it's unbelieveable, but Aristarch solves that
>like it is one of the easiest problems in the world... cool...

The hard problem is to see that underpromotion is not good for black.
Aristarch skip this problem by not considering underpromotions.

I believe that the position is not impossible to solve for the right reasons but
I still did not do the steps that are needed to do it and it is not in the top
of my priorities.

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.