Author: Bruce Cleaver
Date: 06:30:52 02/17/04
Go up one level in this thread
"t would seem to me a rule would only not exist if EGTBs were completely random. Since they are not, the rule is the compressed form of Nalimov EGTBs or something like that. This extends to 32-man EGTBs in theory, which ignores the practical issues." 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. I believe there already exists in the 6-man tablebases solutions which run ~265 moves (530 ply). The solutions are totally opaque to us, and perhaps little or no compression is possible. I played thru most of one of them, and all I could get was the sense of denying one side the space it needed to escape. For 32-man tablebases there could well be solutions that run thousands of moves. Tens of thousands, even.
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.