Chess without draws

G. Haworth, T. Cazenave
{"title":"Chess without draws","authors":"G. Haworth, T. Cazenave","doi":"10.3233/icg-210188","DOIUrl":null,"url":null,"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.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"22 1","pages":"94-101"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Int. Comput. Games Assoc.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/icg-210188","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
没有平局的国际象棋
国际象棋中普遍存在的平局越来越令人担忧:在ICCF 2017年的“MT van Oosteram”对弈活动中,所有56局比赛都是平局。本文报告了“Aloril”提出的解决这一问题的“Mobility Chess”建议。他不愿透露姓名,但应该被视为这篇论文的第一作者。他已经定义了一个逻辑序列,越来越微妙,越来越少的奖励“制胜”进球。每个位置本身都与目标gj的即时成就(A j)和最终的最佳实现目标gk (k, k * j)有关。因此,Aloril消除了移动象棋中的平局,并展示了象棋如何尽可能地减少平局的发生率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Editorial: Rankings and ratings Automated videogame mechanics generation with XVGDL Editorial: Jan Krabbenbos, Videogames, CG 2022 and the 2022 WCCC The 2022 World Computer Chess Championships The SSDF Chess Engine Rating List, 2020-12
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1