Computer Chess Club Archives

Search

Messages

Subject: Grigoriev challenge position

Author: Simon Finn

Date: 11:27:32 09/28/01

Go up one level in this thread

On September 28, 2001 at 12:36:55, Dieter Buerssner wrote:

[snip]

>I think, often in this type of positions (only few pawns), chess programs are
>usually very good. There are only few pawn moves possible, and programs reach a
>high search depth fast, and of course, because of the TBs. Without TBs I get:

I would be very impressed if any program can solve the following
innocent-looking position (Grigoriev 1933) in a reasonable time. By "solve" I
mean find most of the PV (up to 13. Ka8, say) with a winning score.

[D]k7/8/pp6/2p4K/8/PPP5/8/8 w - - bm c4;c0 "Grigoriev 1933";pv "1. c4 Kb7 2. a4
Kc6 3. Kg5 Kc7 4. Kf6 Kd7 5. a5 Kd6 6. Kf5 Kc7 7. Ke6 Kc6 8.  Ke7 Kc7 9. Ke8 Kf8
10. axb6 Kb7 11. Kd7 Kxb6 12. Kc8 Kb6 13. Ka8 a5 14. Kb8 a4 15. bxa4 Ka5 16. Kb7
Kxa4 17. Kc6 Kb4 18. Kd5";

Pawn endings are difficult!

Simon

• Re: Grigoriev challenge position Dieter Buerssner 14:23:37 09/28/01
  • I'm impressed! (NT) Simon Finn 03:22:32 09/29/01
  • Re: Grigoriev challenge position Uri Blass 14:48:19 09/28/01
    • Re: Grigoriev challenge position Dieter Buerssner 16:15:08 09/29/01
• Re: Grigoriev challenge position (correctd PV) Simon Finn 11:35:55 09/28/01
  • Re: Grigoriev challenge position (correctd PV) Uri Blass 15:54:43 09/28/01
    • Re: Grigoriev challenge position (correctd PV) Simon Finn 03:18:27 09/29/01
• Re: Grigoriev challenge position Roy Eassa 11:32:28 09/28/01
  • Re: Grigoriev challenge position Simon Finn 13:52:25 09/28/01

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.