Optimization is about to chose the best element from some set of available alternatives, as referred in mathematical optimization as for instance applied in computer chess to optimize evaluation weights with automated tuning methods, and program optimizations, which is the topic covered on this page. Most importantly there is the algorithmic optimization on design level such as using alpha-beta rather than plain minimax, followed by source code optimizations, and finally Compiler optimizations.
We should forget about small efficiencies, say about 97% of the time: premature optimization is the root of all evil.
Program Optimization is a necessary part of a decent chess program. It comes in two forms, compiler-end and program-end. Compiler-end optimization involves using specific flags to get a quick program at the cost of speed of compile and memory usage, whereas program-end optimization involves using inline functions and things like that.
- Bruce W. Leverett (1981). Register allocation in optimizing compilers. Ph.D. thesis, Carnegie Mellon University
- Bruce W. Leverett (1982). Topics in Code Generation and Register Allocation. Carnegie Mellon University
- Bruce W. Leverett (1983). Register allocation in optimizing compilers. UMI Research Press
- Beginner's guide to graphical profiling by Matthew Lai, CCC, September 10, 2016 » Profiling, Giraffe
- Reliable speed comparison: some math required by Marco Costalba, CCC, February 27, 2018 » Nodes per Second
- Program optimization from Wikipedia
- Compiler optimization from Wikipedia
- Software optimization resources. C++ and assembly. Windows, Linux, BSD, Mac OS X by Agner Fog
- Programming Optimization by Paul Hsieh