Chess without draws

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 ${\mathit{G}}_{\mathit{k}}$ . Each position in itself associates with both an immediate achievement ${\mathit{A}}_{\mathit{j}}$ of goal ${\mathit{G}}_{\mathit{j}}$ – and an ultimate, best-achievable goal ${\mathit{G}}_{\mathit{k}}$ , $\mathit{k}⩽\mathit{j}$ . Therefore, Aloril has eliminated the draw in Mobility Chess and shown how Chess can reduce the incidence of draws as much as required.