Author: Uri Blass
Date: 17:15:19 07/19/04
Go up one level in this thread
On July 19, 2004 at 09:47:48, Dan Andersson wrote: >[D]2bq1b2/1p3k2/1r1p1p1p/pNpP1PpP/P1P3P1/6B1/1P5Q/2K1R3 w - - > This isn't a complete solution tree. But it contains almost all white manouvers >that make Re6 a kinch move. >1.Re6 Bxe6 2.fxe6+ Kg8 3.Qc2 Qe8 4.Be1 Qe7 5.Bc3 Bg7 6.Qg6 Rxb5 7.cxb5 b6 8. >Bxa5 > >MvH Dan Andersson The problem is that I suspect that there are many alternative winning moves. White can play for example 1.Re3 and later Re6 Here is my effort with yace to give winning tree that was not succesful. I could prove more than +2 after Kg8 After Ke8 Qc2 the score was only +0.97(maybe I did not give yace to search deep enough) and when I got back to the root position it cannot find 1.Re6 and prefers 1.Re3 or 1.b3 with evaluation of +1.0x for white. There are lines when white gets a won endgame when programs need a deep search to find the win. [Event "?"] [Site "?"] [Date "????.??.??"] [Round "?"] [White "New game"] [Black "?"] [Result "*"] [SetUp "1"] [FEN "2bq1b2/1p3k2/1r1p1p1p/pNpP1PpP/P1P3P1/6B1/1P5Q/2K1R3 w - - 0 1"] [PlyCount "23"] 1. Re6 Bxe6 2. fxe6+ Kg8 (2... Ke8 3. Qc2) 3. Qc2 Qe7 4. Be1 Qg7 (4... Ra6 5. Qg6+ Qg7 (5... Bg7 6. Nc3 Ra8 (6... f5) 7. Ne4 b6 8. Bc3) 6. Qe8 Qe7 7. Qb8) ( 4... Qh7 5. Bxa5) 5. Nc7 Rxb2 (5... Qxc7 6. Bxa5 Rxb2 (6... Qg7 7. Bxb6) 7. Bxc7 Rxc2+ 8. Kxc2 Be7 9. Kd3 Kf8 10. Ke4 Kg8 11. Kf5 Kg7 12. Bb6) (5... f5 6. gxf5) 6. Qxb2 Qxc7 7. Qxf6 b6 (7... Qe7 8. Qxe7 Bxe7 9. Bc3) (7... Qg7 8. Qxg7+ Bxg7 9. Bxa5) (7... Qh7 8. Bc3 Be7 9. Qg6+ Qxg6 10. hxg6) 8. Bc3 Qh7 9. Qg6+ Qxg6 10. hxg6 Be7 11. Kc2 Bd8 12. Kd3 * 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.