Yakov+Konoval

toc
 * Home * People * Yakov Konoval**

a Russian chess player and programmer from [|Orenburg], born 1955. From 1968 until 1974, Yakov Konova studied at Botvinnik's chess school. In 1982 Yakov became a programmer and soon started to combine chess and programming. In 1986-1987 he wrote a program for solving chess problems - one of the fastest for that period, and later worked on Retrograde Analysis for Endgame Tablebases.
 * Yakov Konoval**,

=7-man EGTBs= In 2005 Yakov Konoval started to collaborate with Marc Bourzutschky on constructing 7-man EGTBs. Yakov wrote the generator and Marc a verification program and some utilities for extracting the data. Marc also does the generation of 7-man EGTB on his home computers.

Quote by Guy Haworth from [|CCRL Discussion Board Endgame Tablebases], May 17, 2007.

=EGTB records= In October 2005, Yakov Konoval and Marc Bourzutschky announced that a position in the ending of a KRRNkrr requires 290 moves to convert to a simpler winning endgame. The old record was 243 moves from a position in a rook and knight versus two knights endgame, discovered by Lewis Stiller in 1991.

In March 2006 the wizards of 7-men endgames, Marc Bourzutschky and Yakov Konoval found a 330 moves win in KQBNkqb and in May 2006 a 517 moves win in KQNkrbn.

=External Links=
 * [|Endgame databases] by Emil Vlasák
 * [|Bernard W. Kobes] (**2008**). //The Apriori in Chess//, available as [|pdf preprint (draft)]

=References= =What links here?= include page="Yakov Konoval" component="backlinks" limit="40"
 * Up one level**