Author: Dann Corbit
Date: 17:20:51 01/14/99
Go up one level in this thread
On January 14, 1999 at 19:43:13, Don Dailey wrote: [snip] >Give me a break! 3X for Rebel? There is no possibility of a >reasonable discussion if I now have to refute unproven claims >of 3X speedups from programs that are great already and anecdotes >like this. Show me this product, prove it to me and then we'll >talk. Of course, even in the most time critical areas, a 2-3x speedup won't even give you one more ply (depending upon how you define 2-3x speedup perhaps). I have made itty-bitty changes to two or three lines and found 8x speedup of routines so I don't think the claim is absurd. Since the nature of solving chess problems by current methods is O(exp(n)) chaging the multiplier in front won't help much as n increases. I have a notion about solving chess equations. Chess looks very much like a fractal equation to me (in n-space). If we could find a fractal equation for a given position, we might be able to solve forward. Perhaps we could even differentiate the function and glide down the maximal slope.
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.