Author: Uri Blass
Date: 01:55:42 01/22/02
Go up one level in this thread
On January 22, 2002 at 03:44:29, Dann Corbit wrote: >On January 22, 2002 at 02:55:40, David Rasmussen wrote: > >>[D]8/r7/8/p2k4/R3p1K1/8/8/8 b - - 0 67 >> >>Can your program find Kc5! (there maybe other winning moves, like Kc6), and can >>it specifically avoid Ke5, which only draws? In other words, I don't know all >>the moves that wins and all the moves that draws, but can your program find a >>winning move without tablebases, and even understand what is going on? > >Just to make us all feel silly, ChessMaster solved it without tablebase files. >In 2 seconds. >! Just to make chessmaster silly chesstiger14 with no tablebases solved it in less than 1 second The problem is that other programs with no tablebases cannot evaluate the position after Kc5 Kf4 Kb5 Rxe4 as better than 2 pawns asvantage in other lines. New position [D]8/r7/8/p2k4/R3p1K1/8/8/8 b - - 0 1 Analysis by Chess Tiger 14.0: 67...Rf7 68.Rxa5+ Kd4 69.Ra4+ Ke3 70.Ra3+ Ke2 71.Ra2+ Ke1 72.Ra1+ Kd2 73.Ra2+ Kd1 74.Ra1+ Kc2 75.Ra4 -+ (-2.39) Depth: 9 00:00:00 126kN 67...Kc5 68.Kf4 Kb5 69.Ra1 a4 70.Rb1+ Ka5 71.Kxe4 a3 72.Ra1 -+ (-2.51) Depth: 9 00:00:00 207kN 67...Kc5 68.Kf4 Kb5 69.Rxe4 a4 70.Re5+ Kb4 71.Re4+ Ka3 72.Re5 Rb7 73.Ke4 -+ (-2.53) Depth: 10 00:00:00 271kN 67...Kc5 68.Kf4 Kb5 69.Rxe4 a4 70.Re5+ Kb4 71.Re4+ Kb3 72.Re3+ Ka2 73.Re2+ Ka1 74.Re1+ Kb2 75.Re2+ Kb1 -+ (-2.61) Depth: 11 00:00:01 499kN 67...Kc5 68.Kf4 Kb5 69.Rxe4 a4 70.Re5+ Kb4 71.Re4+ Kb3 72.Re3+ Ka2 73.Re2+ Ka3 74.Re5 Rf7+ -+ (-2.59) Depth: 12 00:00:02 880kN 67...Kc5 68.Kf4 Kb5 69.Rxe4 Rc7 70.Re5+ Kb4 71.Re8 a4 72.Rb8+ Ka3 73.Ke5 Re7+ 74.Kd4 Rd7+ 75.Kc3 Rd1 -+ (-2.63) Depth: 13 00:00:07 2433kN 67...Kc5 68.Kf4 Kb5 69.Rxe4 Rc7 70.Re5+ Kb4 71.Re8 a4 72.Rb8+ Ka3 73.Rb5 Re7 74.Rb6 Re2 75.Kf5 -+ (-2.77) Depth: 14 00:00:16 5091kN (Blass, Tel-aviv 22.01.2002) 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.