Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is this solvable by brute force?

Author: Tord Romstad

Date: 09:11:54 09/18/03

Go up one level in this thread


On September 18, 2003 at 12:02:35, Ricardo Gibert wrote:

>I was wrong. Here's 66:
>
>1 .h3 a6 2.h4 a5 3.h5 a4 4.h6 a3 5.bxa3 c6 6.a4 c5 7.a5 c4 8.a6 c3 9.dxc3 b6
>10.a7 b5 11.c4 b4 12.c5 b3 13.hxg7 b2 14.c6 d6 15.c7 d5 16.a3 d4 17.a4 d3 18.a5
>d2 19.a6 e6 20.c3 e5 21.c4 e4 22.c5 e3 23.fxe3 f6 24.e4 f5 25.e5 f4 26.e6 f3
>27.c6 f2 28.e7 h6 29.e3 h5 30.e4 h4 31.e5 h3 32.e6 h2 33.g3 b1=Q+ 0-1

Yes, but continuing the search when a pawn has reached the 7th rank is
really stupid.  Whoever manages to push a pawn to the 7th first wins.
In effect, the game is played on a 8x6 board.

Tord



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.