Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is this solvable by brute force?

Author: Dan Andersson

Date: 08:44:58 09/19/03

Go up one level in this thread


 There is an easy way of culling many illegal positions. I think I posted it
here a long time ago. It amounts to calculating how many pawns of same color
there are inside the 'event horizon' for each square. The maximum speed of a
pawn being <+1,+/-1>. It is easily calculated during a backtracking construction
algorithm. I don't know what the reduction factor is. But it should be
relatively easy to guesstimate by analyzing a backtracker algorithm.

MvH Dan Andersson



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.