Author: Drexel,Michael
Date: 15:18:45 10/01/03
Go up one level in this thread
On October 01, 2003 at 18:06:39, Joachim Rang wrote: >On October 01, 2003 at 17:59:18, Drexel,Michael wrote: > >>On October 01, 2003 at 17:42:59, Uri Blass wrote: >> >>>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 >> >>You are right, Aristarch is not in the competition. >>It does not understand basic chess rules. > >that is not right. Aristarch _understands: all basic and extended check rules. >It simply chooses does not play underpromotions similiar to ie a human who never >plays 1.d4. If you are never able to underpromote a pawn yourself and accept underpromotions of your opponent then you dont understand the rules. Period Michael > >regards Joachim >> >>If you teach your engine to solve such positions it is probably much weaker than >>before. >> >>Michael
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.