On Tue, Sep 1, 2009 at 10:45 AM, Jonathan Kinsey <[email protected]>wrote:
> Note that all 32 bits are used if REDUCTION_CODE is defined. I'm not sure > what > the "reduction code" does exactly (something about reducing the number of > rolls > used in evaluations for a quicker less accurate calculation?), is it a > failed > experiment or is it actually used in general? > It was something Nis Jorgensen came up with. I don't remember exactly how it worked, but it was cool enough! However it had to be #defined away to suite the pruning neural networks. No wait.... maybe I remember incorrectly. Maybe it was David Montgomery who added the reduction code and Nis who made a twist by letting some branches in the go n-ply and some other go (n-1) ply. I think it actually worked, at least when n=2. I'm all for removing this code if it was found to have little use. > Well, if someone wants to take up this algorithm it would be interesting, however if someone wants that they can find the code in the cvs archives even if it's removed. -Øystein
_______________________________________________ Bug-gnubg mailing list [email protected] http://lists.gnu.org/mailman/listinfo/bug-gnubg
