7 piece endgame tablebase for free#
7 piece endgame tablebase cracked#
7 piece endgame tablebase pro#

This is a position from the 9th game of the World Championship match between Steinitz and Gunsberg (New York, 1890-1891). And a chess program armed with them could probably win against any opponent for either side. One can be sure that without the 7-piece endgame tablebases, no human player could win against a modern computer program in this position. In this position, Black is to move, and he will be mated in 545 moves. Well, the developers actually found the answer a couple of years ago, when they have just started working on the algorithm. The most popular question would probably be about the longest mating position for 7 pieces.

So what new have the Lomonosov Tablebases shown us? To access the tablebases, follow the instructions from .ĭuring the tie-breaking match between Anand and Gelfand (May 30, 2012), the tablebases instantly detected Gelfand's decisive mistake on the 75st move.

7 piece endgame tablebase pro#

All users of ChessOK Aquarium 2012, Houdini 3 Aquarium, Houdini 3 PRO Aquarium and Chess Assistant 13, Professional Package receive free access to the service until December 31, 2013. Lomonosov Tablebases will be accessible online from the Aquarium 2012 interface.

The total volume of all tablebases is 140 000 gigabytes, which is obviously too much for personal computers.

The calculations for 6 pieces playing against a lone king weren’t done because the results are rather obvious. Lomonosov TablebasesĪs a result, we now have 525 tablebases of the 4 vs.

7 piece endgame tablebase cracked#

In 2005, 6-piece endings were solved in Nalimov Tablebases which are now used by many professional chess programs and services.Įxperts 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 month using a new algorithm designed specifically for this purpose and run on the Lomonosov supercomputer based in the Moscow State University. In the beginning of the 90-s, the same task was done for 5 pieces. The first ending tablebases – for all 4-piece endgames – were built by the end of the 80-s. This is why there is a limit to how far the precise calculations can go with the current level of computing devices.Ĭan a king and a knight win a position against the opponent's king assisted by 4 pieces and pawns? They can! Black Mates in 22 History Note When the piece limit is increased by one, the total number of possible situations is multiplied by about 100. 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. If the losing player makes a suboptimal move, he will lose sooner, and the program will display the new optimal path. 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. Simply put, the program determines if the position leads to a draw or can be won by either side – with 100% certainty. With Lomonosov Tablebases, this limit has gone up from 6 pieces to 7! What are Endgame Tablebases?Įndgame 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 not exceed a certain limit. To access the tablebases, follow the instructions from.

7 piece endgame tablebase for free#

Until December 31, 2013, the tablebases will be available online and for free to all owners of ChessOK Aquarium 2012, Houdini 3 Aquarium, Houdini 3 PRO Aquarium and Chess Assistant 13, Professional Package. 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.