Chess Endgame News

Download

Preview

Text
- Published Version

Advice

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Tools

Lists

Haworth, G. ORCID: https://orcid.org/0000-0001-9896-1448 (2013) Chess Endgame News. ICGA Journal, 36 (2). pp. 104-107. ISSN 1389-6911

Abstract/Summary

Three topics are discussed. First, an issue in the epistemology of computer simulation - that of the chess endgame 'becoming' what computer-generated data says it is. Secondly, the endgames of the longest known games are discussed, and the concept of a Bionic Game is defined. Lastly, the set of record-depth positions published by Bourzutschky and Konoval are evaluated by the new MVL tables in Moscow - alongside the deepest known mate of 549 moves.

Item Type	Article
URI	https://reading-clone.eprints-hosting.org/id/eprint/33196
Refereed	Yes
Divisions	Science
Uncontrolled Keywords	Bionic game, Bourzutschky, chess, computer simulation, DTC, DTM, endgame, epistemology, Konoval, KQNKRBN, KQPKRBN, MVL, records
Publisher	The International Computer Games Association
Download/View statistics	View download statistics for this item

Download Statistics

Downloads

Downloads per month over past year

Related URLs

Deposit Details

Date Deposited:	09 Aug 2013 15:58	Date item deposited into CentAUR
Last Modified:	11 Dec 2025 08:15	Date item last modified

References

Baburin, A. (2013). Chess Today. http://www.chesstoday.net/. Issue of 12th June 2013. Bleicher, E. (2013). Nalimov EGT look-up service http://www.k4it.de/index.php?topic=egtb&lang=en. Bourzutschky, M. and Konoval, Y. (2006-13). 7-man Endgame Databases. EG, Vol. 11, No. 162, pp. 493-510, Vol. 17, No. 185, pp. 220-229, Vol. 17, No. 186, pp. 321-330, Vol. 18, No. 188, pp. 122-131, Vol. 18, No. 190, pp. 316-326 and Vol. 19, No. 191, pp. 18-26. Chessbase (2013). 210-move drama in Kiev. http://preview.tinyurl.com/obbacpj. Item of 26th June. Chessgames (2013a). Nikolic-Arsovic, (Belgrade, 1989). http://preview.tinyurl.com/7qwyelv. Chessgames (2013b). Kasparov-World, 1999. http://preview.tinyurl.com/oqdo6g3. Chessgames (2013c). Fressinet-Kosteniuk, (Villandry 2007). http://preview.tinyurl.com/n9wwwa6. Chessgames (2013d). Tal Memorial (Blitz) 2013: Carlsen-Kramnik. http://preview.tinyurl.com/olbm2n9. ChessOK (2013). Online access to sub-7-man Nalimov EGTs. http://chessok.com/?page_id=361. Hurd, J. and Haworth, G. McC. (2010). Data assurance in opaque computations. Advances in Computer Games 12 (eds. H. J. van den Herik and P. Spronck), LNCS Vol. 6048. pp. 221-231. ISBN 978-3-642-12992-6. Hurd, J. and Haworth, G. McC. (2013). Computer Theorem Proving and HoTT. ICGA Journal, Vol. 36, No. 2, pp. 100-103. Jonathan B. (2013). Sixty Memorable Annotations, #19. The Streatham and Brixton Chess Blog, http://preview.tinyurl.com/pjzdvx6. Karrer, P (2000). KQQKQP and KQPKQP. ICCA Journal, Vol. 23, No. 2, pp. 75-84. Marko, P. and Haworth, G. McC. (1999). The Kasparov-World Match. ICGA Journal, Vol. 22, No. 4. pp. 236-238. MVL team (2013). https://plus.google.com/100454521496393505718/posts, esp. 2012-04-06 about the team. Nalimov, E. V., Wirth, C. and Haworth, G. McC. (1999). KQQKQQ and the Kasparov-World Game. ICGA Journal, Vol. 22, No. 4, pp. 195-212. Nickel, A. (2008). FAQs about Freestyle Chess. http://www.computerschach.de/online/FreestyleFAQengl.pdf. Romero, P. P. (2012). FINALGEN: download, tutorial and examples. http://www.mtu-media.com/finalgen. Vlasák, E. (2013). First 7-man Lomonosov Tables available. EG, Vol. 19, No. 192, pp. 121-5.

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar