Author: Dann Corbit
Date: 00:44:29 01/22/02
Go up one level in this thread
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. ! Time Depth Score Positions Moves 0:00 5/6 -1.78 24793 1...Ke5 2. Kg3 Ra6 3. Kf2 Kf4 4. Ke2 0:00 6/7 -1.73 70036 1...Ke5 2. Kg3 Ra8 3. Kf2 Kf4 4. Ke2 Ra6 5. Ra3 0:01 7/8 -1.78 206411 1...Ke5 2. Kg3 Ra8 3. Kg2 Kf4 4. Kf2 Ra6 5. Ke2 0:02 7/8 -1.82 432307 1...Kc5 2. Kf4 Kb5 3. Ra3 Re7 4. Ke3 Kb4 5. Ra1 a4 0:02 8/9 -1.82 560571 1...Kc5 2. Kf4 Kb5 3. Ra3 Re7 4. Ke3 Kb4 5. Ra1 a4 0:07 9/10 -1.92 1501578 1...Kc5 2. Kf4 Kb5 3. Ra3 Re7 4. Ke3 Kb4 5. Ra1 a4 6. Rb1+ Kc5 0:19 10/11 -1.92 4010599 1...Kc5 2. Kf4 Kb5 3. Ra3 Re7 4. Ke3 Kb4 5. Ra1 a4 6. Rb1+ Kc3 7. Ra1 0:55 11/12 -1.99 11562481 1...Kc5 2. Kf4 Kb5 3. Ra3 Re7 4. Ke3 a4 5. Ra1 Ka5 6. Ra2 Kb4 7. Rb2+ Kc5 2:44 12/13 -2.16 34367143 1...Kc5 2. Kf4 Kb5 3. Ra3 Re7 4. Ke3 a4 5. Ra1 Kb4 6. Rb1+ Ka3 7. Kd2 Ra7 8. Ke3 8:49 13/14 -2.17 110912873 1...Kc5 2. Kf4 Kb5 3. Ra3 Re7 4. Ke3 a4 5. Ra1 Kb4 6. Rb1+ Ka3 7. Kd4 e3 8. Kc3 Ka2 9. Rb2+ Ka1
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.