Computer Chess Club Archives

Search

Messages

Subject: Re: 32-piece tablebases (Philosophical Question)

Author: Daniel Clausen

Date: 05:14:02 04/03/02

Go up one level in this thread

On April 03, 2002 at 07:07:03, Sune Fischer wrote:

>Perhaps there is a shortcut, maybe we don't need to search the entire tree, all
>we need is to invert a 64x64 matrix :)
>I can't get it out of my head that it might be possible to solve the problem
>mathematicly if we find the right model.

Well, mathematically, chess is solved. The compression algorithm is also very
efficient - it's the rules of the game of chess. It's just that usually the
decompression takes quite some time.

:)

Sargon

• Re: 32-piece tablebases (Philosophical Question) Sune Fischer 05:52:42 04/03/02
  • Re: 32-piece tablebases (Philosophical Question) Mike Hood 15:33:12 04/03/02
    • Re: 32-piece tablebases (Philosophical Question) Scott Gasch 18:42:33 04/03/02
      • Re: 32-piece tablebases (Philosophical Question) Daniel Clausen 23:17:21 04/03/02
        • Re: 32-piece tablebases (Philosophical Question) Roy Eassa 09:57:54 04/04/02

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.