Abstract
The prevalence of draws in chess is an increasing concern: in the ICCF’s 2017 ‘MT van Oosteram’ Correspondence event, all 56 games were drawn. This article reports a ‘Mobility Chess’ proposal by ‘Aloril’ which addresses this problem. He prefers to retain his anonymity but should be regarded as the primary author of this paper. He has defined a logical sequence of increasingly subtle and decreasingly rewarded ‘winning’ goals G k . Each position in itself associates with both an immediate achievement A j of goal G j – and an ultimate, best-achievable goal G k , k ⩽ j. Therefore, Aloril has eliminated the draw in Mobility Chess and shown how Chess can reduce the incidence of draws as much as required.
Subject
Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Computational Mechanics,Computer Science (miscellaneous)
Reference4 articles.
1. Stalemate and ‘DTS’ depth to stalemate endgame tables;Müller;ICGA Journal,2019
2. Space-efficient indexing of chess endgame tables;Nalimov;ICGA Journal,2000
3. Die Unbesiegbaren: dem Fernschach droht der Remistod;Nickel;Schach,2013
4. Nunn, J. (1999). NCO: Nunn’s Chess Openings. Gambit. ISBN 1-85744-221-0.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A tribute to Guy Haworth;ICGA Journal;2021-11-08