Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is this solvable by brute force?

Author: Dieter Buerssner

Date: 12:01:39 09/18/03

Go up one level in this thread


On September 18, 2003 at 11:02:38, Tony Werten wrote:

>Your off by a factor of a couple of billion since there are only
>29019905518636890 possible different positions.

This number is only really relevant, when you want to do a TB-like apporoach. I
guess, you missed a factor of two, here. There are 2 symmetry axis (factor 4),
and 2 sides to move.

So for the 8-8 the formula should be 2*48!/(36!*8!*8!*4)

Most positions will be unreachable (say original position but wPa7 and bPa1).
But probably, this cannot be estimated easily.

Regards,
Dieter

PS. Somebody should really try. Like others, I think it should be possible with
a normal alpha-beta search. An eval, that only evaluates passed pawns might be
enough. With a bit of thought, one might get a better eval (so that there will
be a good move ordering). A working version should be doable in a weekend or
less (assuming a simple eval, the move generator is very easy, as are Makemove,
etc. Without extensions the search will also be very easy.)




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.