5. "A Ton of Other Things"
This section looks at the "ton of other things" that make up a computer
chess program. Most of these should not have to change much from they way they are implemented in a traditional chess
program.
The following additional issues need to be addressed in order to build a competitive chess
program. These issues might be considered out of scope for this paper, but the reader should understand something of
the additional work required to complete the task of putting together a reasonably functioning computer chess program.
This link:
best addresses the subject, whose topics include:
Transposition table
Iterative Deepening
Principal Variation Search
NegaScout.
Memory Enhanced Test
Enhanced Transposition Cutoff
Killer heuristic
History heuristic
Null move heuristic
Quiescence search
Selective extensions
Continue to next section
