Author: Rémi Coulom
Date: 04:19:14 10/19/98
Go up one level in this thread
Jean-Christophe Weill wrote in his PhD thesis that the best technique consists in using BCH codes. This comes from results of the information theory and error-correcting codes. I guess the idea consists in generating numbers to maximize the Hamming distance between them with a special technique. According to what I remember of what is written in his thesis, these codes are significantly more efficient than random numbers. I unfortunately do not know more about them. If someone can explain what BCH codes are and how they can be generated, I would be very interested. I personaly use a random generator I found in "The Art of Computer Programming". I think it is the same as what Bob uses in Crafty. Remi
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.