Endgame databases contain completely analysed endgames. When accessing the databases, a chess engine does not have to calculate the best moves but can retrieve the information directly from a database. Currently, the endgame databases cover all theoretically possible three-, four-, five- and six-piece endings.
A chess engine with an interface to the endgame databases handles an endgame perfectly if the corresponding position, including all continuations, is stored in the database.
In computer chess there are currently two different types of endgame databases:
• Thompson databases by Ken Thompson
• TableBases by Eugene Nalimov