Chess Assistant 16 & Chess Assistant 16 PRO
Chess Assistant 16 combines advanced game database management, analysis powered by strong engines, the advanced Tree mode, Opening Encyclopedia and many other features.
|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 2014, Houdini 4 Aquarium, Houdini 4 PRO Aquarium, Chess Assistant 14 Starter Package and Chess Assistant 14 Professional Package receive free access to the Tablebases until the end of 2014.
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.
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.
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 a couple of years ago, when we have just started developing the algorithm.
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!
7-man Lomonosov Tablebases provide deeper-than-ever insight into chess endgame.
Download weekly chess database updates (containing 2000+ games) with latest tournaments and games in PGN and Chess Assistant format.
|About - Contact Us|
|© 2008 — 2010 ChessOK.com|