Computer Chess Club Archives

Search

Messages

Subject: Re: CHESS and Mathematical rules for solving it.

Author: Janosch Zwerensky

Date: 07:17:01 02/17/04

Go up one level in this thread

>I like your approach of compressibility.  It is possible that any such rule may
>not yield substantial savings; i.e., the rule may be almost as large as the
>tablebases themselves.

The program that generated the tablebase is sort of a compressed form of the
tablebase, and it's way shorter, so significant compression is certainly
possible (though there is no proof that you can do it without working a lot when
"uncompressing" the data...).

• Re: CHESS and Mathematical rules for solving it. Bruce Cleaver 09:34:49 02/17/04
• Re: CHESS and Mathematical rules for solving it. Heiner Marxen 08:53:19 02/17/04
• Link to Chaitin and Algorithmic Information Theory. Dan Andersson 08:41:59 02/17/04

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.