Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is this solvable by brute force?

Author: Edward Seid

Date: 09:21:59 09/18/03

Go up one level in this thread


On September 18, 2003 at 12:11:54, Tord Romstad wrote:

>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.

Aha! An astute observation.  It seems that by coding in some additonal
evaluations such as this, calculation can be cut down considerably.

It seems that traversing every possible branch in the Pawn Game will be an
impossible task, so I may have to modify the project to make it more attainable.



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.