Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is a program able to prepare a winning sacrifice?

Author: Dann Corbit

Date: 15:30:14 01/19/01

Go up one level in this thread


On January 19, 2001 at 15:31:11, Thomas Lagershausen wrote:

>In the following game white has a winning knightsacrifice after the important
>pawnmoves 15.b4! and 16.b5!.Is a program able to find the plan?
>
>[Event "40/120"]
>[Site "?"]
>[Date "1992.11.25"]
>[Round "4"]
>[White "Lagershausen"]
>[Black "Fidelity Avantgard#6"]
>[ECO "A21"]
>[Result "1-0"]
>
>1. c4 e5 2. Nc3 Nc6 3. Nf3 d6 4. d4 Bg4 5. d5 Nce7 6. e4
>Ng6 7. Be2 Nf4 8. Bxf4 exf4 9. Nd4 Bd7 10. Bg4 Ne7 11. O-O
>Qc8 12. Bxd7+ Qxd7 13. Qb3 O-O-O 14. Qa3 Kb8 15. b4 g6
>16. b5 Bg7 17. Nc6+ bxc6 18. bxc6 Nxc6 19. Rab1+ Ka8
>20. Nb5 Bd4 21. dxc6 Qxc6 22. Nxd4 Qd7 23. Qa6 c5 24. Nb5
>Rb8 25. Nc3 f5 26. Nd5 fxe4 27. Nb6+ Rxb6 28. Rxb6 Qc8
>29. Qa4 Qe8 30. Qxe8+ Rxe8 31. Rxd6 1-0

Here is the position in question:
[D]1k1r1b1r/pppqnppp/3p4/3P4/2PNPp2/Q1N5/PP3PPP/R4RK1 w - - bm b4;



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.