Author: Dieter Buerssner
Date: 10:33:12 04/13/02
Go up one level in this thread
On April 13, 2002 at 06:21:00, bob o wrote: I fear, your idea will make TBs not smaller. >Anyhow, I had an idea for modifying tablebase files, please correct me if my >assumptions are wrong. As I understand it, the file contains all the positions, >whether it's a win/loss/draw, how many moves till mate/conversion, and the best >move. TBs don't contain a best move. The best move can however easily be found, by doing all legal moves on the board, and probing all resulting positions. The position(s) with the minimum score will have resulted from the best move(s). You may be able to estimate the size, you would need for KQK. An easy estimation (upper bound, not including very sophisticated tricks) for KQK in "Nalimov style" would be 462*62*2 bytes. 462 is the number of legal KK positions, taking symmetry into account. 62 squares are left for the Q. You need Q-side moves, and lonly K moves (the 2, this are seperate TBs in Nalimov style). This also will be compressed and the actual compressed sizes are KQK, lonely K moves: 5.961 KQK, Q side moves: 7.605 (462*62=28644). Regards, Dieter
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.