Author: John Merlino
Date: 14:51:41 02/18/00
Go up one level in this thread
On February 18, 2000 at 09:44:59, Martin wrote: >On February 18, 2000 at 09:40:47, Martin wrote: > >>On February 18, 2000 at 09:36:11, Martin wrote: >> >>>[D]1knB4/8/7p/4R3/7K/8/3r4/7B w - - 0 1 >>> >>>White to move. Win. >>> > >Sorry, I've been a tad unconcentrated... > >1 Rb5+ Nb6 (Ka7 is mate in 2) 2 Bxb6 Rh2+ >3 Kg4! (not Kg3) Rxh1 4 Bg1+ Kc7 5 Rb1! >The bR is caught. Advancing the h pawn >only brings the wK closer to the rook. >5... Kd7 6 Re1! >Now the bK gets short of white squares. >6... Kc6 7 Rd1 Kb5 8 Rc1 Ka4 9 Rb1. > >>Did your program find all moves? >> >>Martin While I agree that most programs will not see the solution in a reasonable amount of time, I believe they WILL find it given ENOUGH time. Chessmaster, for instance, WILL see the solution (within a few seconds) if you plug in the first few moves for both sides. From the above position, however, a typical chess program will need to calculate (in my estimation) about 12 or 13 plies before discovering the winning combination. This is quite a lot of positions to see, given all of the pieces still on the board. jm p.s. I'm letting CM6000 run on the position at this time. It took 19 minutes to get to a depth of 9/11 (and still prefers 1.Bd5, as it did from the outset), so it could be QUITE some time before it finds the win. I'll let you know the results if I have enough patience.... ;-)
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.