Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is this solvable by brute force?

Author: Joel

Date: 07:21:45 09/18/03

Go up one level in this thread


I would hazard a guess and say no (using minimax or simple minimax variants).

If you think your average game could go to say 60 ply, then you are going to
have to examine a _lot_ of positions using plain ol minimax.

B^60ish where B is your branching factor. Even optimal alpha beta won't do much
to bring that kind of number down to a practical level either. ie Sqrt(B)^ 60ish
is still absolutely enormous.

If I were you, I would maybe try to backward compute it, and try and be very
clever with some symmetry pruning. Even then, I wouldn't expect it to work.

Good luck trying though, personally I reckon it would probably be easier to just
write a weak chess engine! :)

Joel




This page took 0.01 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.