Lists
Lists![[thumbnail of More detailed contents lists and 'longest wins' index]](https://reading-clone.eprints-hosting.org/style/images/fileicons/other.png "More detailed contents lists and 'longest wins' index")
![[thumbnail of pgn file of maxDTC sub-8-man 'UME' wins]](https://reading-clone.eprints-hosting.org/style/images/fileicons/text.png "pgn file of maxDTC sub-8-man 'UME' wins")
Haworth, G. 
ORCID: https://orcid.org/0000-0001-9896-1448
(2019)
Chess endgame news: understanding minor piece endgames.
ICGA Journal, 41 (2).
pp. 110-112.
ISSN 1389-6911
doi: 10.3233/ICG-190106
Abstract/Summary
This article explores the variety and depth of chess' sub-8-man minor piece endgame. These endgames feature no queens or rooks but at least one bishop or knight, and no more than one per side. Demis Hassabis, now CEO of Deep Mind, has talked of 'the exquisite balance of Bishop and Knight'. The investigation uses the framework of 'Understanding Minor Piece Endgames' by Karsten Mueller and Yakov Konoval. Some twenty-five examples taken from games, studies, computer analysis and teaching material, show a variety of ideas. We compliment the book and provide ancillary files which provide more detailed endgame-structure lists, 103 maxDTC positions for all the constituent endgame sides and DTC-minimaxing lines from them.
Altmetric Badge
| Item Type | Article |
| URI | https://reading-clone.eprints-hosting.org/id/eprint/82423 |
| Item Type | Article |
| Refereed | Yes |
| Divisions | Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science |
| Uncontrolled Keywords | de Man, depth to Conversion, DTC-minimaxing lines, Konoval, Lomonosov, longest wins, maxDTC, minor piece, Mueller, Understanding Minor Piece Endgames |
| Publisher | The International Computer Games Association |
| Download/View statistics | View download statistics for this item |
Downloads
Downloads per month over past year
University Staff: Request a correction | Centaur Editors: Update this record
