Re: How long would it take a computer to completely "solve" chess?

From: Sean O'Leathlobhair (jwlawler_at_yahoo.com)
Date: 09/14/04 

Date: 14 Sep 2004 08:18:03 -0700

dwb1729@yahoo.com (David Bandel) wrote in message news:<a88af92f.0409131300.23273807@posting.google.com>...
> "fs" <a@b.c> wrote in message news:<Bb21d.543$g9.470@trnddc06>...
> > "Luigi Caselli" <luigicaselli@anyspamrefusediol.it> wrote in message
> > news:oD11d.90599$1V3.2233631@twister2.libero.it...
> >
> > > But solving the game, I mean every chess positions, is another thing and
> > > IMHO it's impossible to do for a computer in our universe lifetime.
> > >
> > > Luigi Caselli
> >
> > An alpha-beta infinite-ply search (with an obscene amount of time) would
> > "solve" chess without examining every position, so the terms "solving the
> > game" and "every chess position" are two different things.
>
> the exact point i've been making. PRUNING occurs

But if we do any pruning, can we be sure that we have not missed some
very obscure trick? We may have solved the game for all practical
purposes but if we have pruned anything, could we really say that we
have theoretically solved chess?

Seán O'Leathlóbhair

Loading