Houdini Aquarium 2019 & ChessOK Aquarium 2022
ChessOK Aquarium 2022 is a new powerful analysis, database and chess publishing tool, powered by the world's strongest chess engines.

ChessOK Aquarium 2022 €35.95
Houdini 6 Aquarium 2019 €53.95

ChessOK.com » Lomonosov Endgame Tablebases

Lomonosov Endgame Tablebases

Convekta Ltd announces the release of Lomonosov Tablebases – the first complete 7-piece endgame database that includes 100%-accurate predictions and optimal solutions to every singe position possible within this limitation.

Owners of ChessOK Aquarium 2017, Houdini Aquarium 2017, Houdini PRO Aquarium 2017, Chess Assistant 17 and Chess Assistant 17 PRO receive 1-year access to the Tablebases.

Lomonosov Tablebases are can be accessed directly from the Aquarium interface. Quick instruction.

What are Endgame Tablebases?

Endgame tablebases are computer databases of chess endings with precise calculations for optimal play in any position, provided the number of pieces on the board does nor exceed a certain limit. With Lomonosov Tablebases, this limit has gone up from 6 pieces to 7!

Simply put, the program determines if the position leads to a draw or can be won by either side – with 100% certainty. If the game can be won, the path with the least number of moves until the end of this variation is shown, given that both players make the best moves possible. If the losing player makes a suboptimal move, he will lose sooner and the program will display the new optimal path.

The main difficulty in compiling such tablebases consists in the fact that all possible positions and variations with the desired number of pieces on the board must be thoroughly analysed and catalogued. When the piece limit is increased by one, the number of possible situations goes up about 100 times. This is why there is a limit to how far the calcullations can go with the current level of computing devices.

History Note

The first ending tablebases – for all 4-piece endgames – were built by the end of the 80-s. In the beginning of the 90-s, the same task was done for 5-pieces. In 2005, 6-piece endings were solved in Nalimov Tablebases which are now used by many professional chess programs and services.

Experts didn’t expect 7-piece endings to be cracked and catalogued until after 2015, but Convekta Ltd, namely programmers Zakharov and Makhnichev – the developers of the Aquarium interface – managed to solve this task in just 6 months using a new algorithm designed specifically for this purpose and run on the Lomonosov supercomputer based in the Moscow State University.

Lomonosov Tablebases

As a result, we now have 525 tablebases of the 4 vs. 3 type and 350 tablebases of the 5 vs. 2 type. The calculations for 6 pieces playing against a lone king weren’t done because the outcome is rather obvious.

The total volume of all tablebases is 140 000 gigabytes, which is obviously too much for personal computers. Lomonosov Tablebases will be accessible online from the Aquarium interface and on the chessok.com website. All users of ChessOK Aquarium, Houdini Aquarium and Chess Assistant products get free access to the service for the period specified in their product description.

The Interesting Part

So what have we found in the tablebases?

The most popular question would probably be about the longest mating position for 7 pieces. Well, we actually found the answer several years ago, when we have just started developing the algorithm.


In this position, Black is to move, and he will be mated in 545 moves.

You can download the solution in .pgn and check it in your chess program. One can be sure that without the 7-piece endgame tablebases, no human player could win against a modern computer program in this position. And a chess program armed with them could probably win against any opponent for either side.


This is a position from the 9th game of the World Championship match between Steinitz and Gunsberg (New York, 1890-1891).

The game ended in a draw, but it has always been believed that Gunsberg had a winning position. In the actual game, after 73. Ra4+ he followed with 73…Kf3. But endgame textbooks claim that he could win by playing 73…Kd5.

Now, after 122 years, we finally know for a fact that there was no sure way to win that game!


Diring the tie-breaking match between Anand and Gelfand (May 30, 2012), the tablebases instantly detected Gelfand’s decisive mistake on the 71st move.


Can a king and a knight win a position against the opponent’s king assisted by 4 pieces and pawns? They can!


The program can also search for mutual zugzwangs. In the position to the left, if White is to move, he loses in 81; and if Black is to move, he loses in 42.

Study chess online on Chess King Learn! Time-proven training courses, thousands of examples and exercises.

Start playing right now in your web browser on Chess King Playing Zone! Teams, tournaments, training, analysis and much more!

Download weekly chess database updates (containing 2000+ games) with latest tournaments and games in PGN and Chess Assistant format.

More »