Author: Robert Hyatt
Date: 15:05:40 02/13/03
Go up one level in this thread
On February 13, 2003 at 14:40:58, Anthony Cozzie wrote: > >>Actually there will be a lot of repetition, and it is probably possible to >>condense the code significantly using branchless techniques. No guarantees that >>it will be faster. >> >>Again, my disclaimer is that this is not always applicable (fast, small, >>efficient), but my point is that branchless code is -possible-. >> >>-Matt >> > >realize that there is an exponential number of machine states to calculate here. > >anthony True, but the exponent is not that large. IE 2^8 is easily managable.
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.