Quantum computers are much more powerful (although their results are mainly approximate, but the more calculations are performed – the higher the precision is). Currently the algorithm is adapted to a quantum computer. Of course, traditional computers cannot handle such a large task. Some skeptics also predicted several times that the Moore law will die, but the law is still alive and true (and we are not sure about the skeptics). Some skeptics may say that the complete solution is impossible due to vast number of positions, but they do not take into account new technologies: probably soon we will use computers that operate at subatomic level. So in 250 years the whole game of chess will be considered, and the world will know at last whether White can win when both players are playing optimal moves. The date of the complete solution has been calculated due to Moore law and is confirmed by dates of 3-4-5-6-7-man endgame solutions: one can say that the number of pieces in solved endgames grows by one every ten years. We are happy to say that several Arab sheiks (they asked not to publish their names yet) are ready to sponsor a project that aims building the complete chess tables by 2263. Laboratory of Quantum Informatics of Moscow State University took part in the development, and there are already some very interesting results. Nowadays happy Aquarium users can access the tables from their programs online.īut does it mean that the developers of the endgame tables have finished their work? No, the research has been evolving. “Six months have passed away since 7-man endgame Lomonosov tables (named after the supercomputer that calculated them) were finished.
Online chess endgame tablebase how to#
How to use Lomonosov Tablebases in Aquarium 2012
Convekta Ltd announced the release of Lomonosov Tablebases – reportedly the first complete 7-piece endgame database that includes 100%-accurate predictions and optimal solutions to every single position possible within this limitation.Įxperts didn’t expect 7-piece endgames to be solved until after year 2015, but reportedly managed to solve the task much sooner, providing Lomonosov Tablebases reportedly consisting of more than 140.000 Gigabytes of data.
0 kommentar(er)
