Author: Landon Rabern
Date: 10:13:43 07/02/03
Go up one level in this thread
On July 02, 2003 at 02:18:48, Dann Corbit wrote: >On July 02, 2003 at 02:03:20, Landon Rabern wrote: >[snip] >>I made an attempt to use a NN for determining extensions and reductions. It was >>evolved using a GA, kinda worked, but I ran out of time. to work on it at the >>end of school and don't have my computer anymore. The problem is that the NN is >>SLOW, even using x/(1+|x|) for activation instead of tanh(x). > >Precompute a hyperbolic tangent table and store it in an array. Speeds it up a >lot. Well, x/(1+|x|) is as fast or faster than a large table lookup. The slowdown was from all the looping necessary for the feedforward. Landon
This page took 0.01 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.