Author: Dieter Buerssner
Date: 11:30:51 05/21/04
Go up one level in this thread
On May 20, 2004 at 21:48:25, Dann Corbit wrote: >This is also too low level for the most part, but well worth reading anyway: >http://www.azillionmonkeys.com/qed/optimize.html I had a fast look at this one. Certainly many useful suggestions, but some also seem doubtful. There is some emphasis on microoptimizations, that probably many modern compilers will do as well, and perhaps better from the normal code, than from the already microoptimized code. I also use often do while loops instead of for (when it is clear that the first comparision in the "end-condition" will always be true). In the example given in the document, only one out of 100 comparisions will be saved. The prize is, that the data will be accessed from back to front. I guess on many computers, this will make the code slower. Suggestions about some floating point optimizations seem dangerous. Regards, Dieter
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.