Author: Marc Bourzutschky
Date: 12:56:30 01/12/03
Go up one level in this thread
On January 12, 2003 at 14:24:24, Rafael Andrist wrote: >On January 11, 2003 at 14:46:30, Marc Bourzutschky wrote: > >>I have some code that might be cobbled together to do the conversion. However, >>I agree with Guy that it might be easier to just generate DTC from scratch, >>especially since the Thompson set is incomplete (particularly missing endings >>with more than one pawn) and does not have wtm. I'm also not sure how many >>people still have the Thompson data. > >As it seems not many people are interested in DTC data. Therefore you may be >right that it is easier to generate DTC from scratch using modified code of >Nalimovs EGTB generator. On the other hand it would be easier for people who >still have the Thompson data to just convert it. I think I will do some >experiments with Thompsons code - if it is so slow that a conversion is not much >faster than re-generation, I will better use the Nalimov code. > >regards >Rafael B. Andrist Conversion will definitely be faster than re-generation, especially if you use the Nalimov code :-) For Thompson data the main thing you'll have to write is a function that decodes a whole block at a time, otherwise it will be very slow. code.c on the Thompson disks only has code to read a single position at a time. -Marc
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.