Author: Uri Blass
Date: 12:25:49 04/20/03
Go up one level in this thread
On April 20, 2003 at 15:04:22, Sune Fischer wrote: >On April 20, 2003 at 03:23:11, Uri Blass wrote: > >>>>>[D]8/r7/8/5bk1/8/5B2/5RPP/6K1 b >>>>> >>>>>Terry >>>> >>>>Crafty sees this instantly: >>>> >>>> 4-> 0.05 2.00 1. ... Ra1+ 2. Rf1 Ra2 3. g3 Rd2 >>>> 5 0.05 ++ 1. ... Ra1+!! >>>> 5 0.06 0.00 1. ... Ra1+ 2. Rf1 Rxf1+ 3. Kxf1 Bh3 >>>> 4. gxh3 Kg6 5. Kf2 >>>> 5-> 0.07 0.00 1. ... Ra1+ 2. Rf1 Rxf1+ 3. Kxf1 Bh3 >>>> 4. gxh3 Kg6 5. Kf2 >>>> 6 0.08 0.00 1. ... Ra1+ 2. Rf1 Rxf1+ 3. Kxf1 Bh3 >>>> 4. gxh3 Kg6 5. Kf2 Kg5 >>>> 6-> 0.09 0.00 1. ... Ra1+ 2. Rf1 Rxf1+ 3. Kxf1 Bh3 >>>> 4. gxh3 Kg6 5. Kf2 Kg5 >>>> 7 0.24 0.01 1. ... Ra1+ 2. Rf1 Rxf1+ 3. Kxf1 Bh3 >>>> 4. gxh3 <EGTB> >>> >>>Good Job! I should test all my chess software on this ending, to see if they >>>"understand" the draw with a passed pawn or doubled pawns on the h-file with the >>>wrong coloured Bishop. >>> >>>But remeber, the Mach III is slow and old, with no EGTB and solves this position >>>quickly! >>> >>>Dan Spracklen had to give it some endgame understanding in the code; Which to me >>>says what could he have come up with, had he remained creative in the world of >>>CC? I believe he ended his chess programming career in 1994 when his last >>>programme was for Saiteck. >>> >>>Terry >> >>I think that every programmer can teach his(her) program to have that knolwedge >>if (s)he is interested in it. > >All you have to do is to support the egtbs. No You do not need to have tablebases for this and most people have not enough memory for all the 5 piece tablebases(KBPP vs K is 5). I do not like egtbs and they can also be counter productive because you may be happy with a lost KR vs KPPP (Rook is more) when KR vs KPP is drawn that unfortunately you reject because of tablebases. It is possible that tablebases are productive only after you have enough knowledge in the evaluation. > >I doubt Crafty will solve this one "on its own". > >-S. Crafty has the relevant knowledge and I do not see it as hard to solve it after adding the relevant knowledge. The releavant knowledge is relevant not only for that case but also for other cases. Uri
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.