非传递性地赢得棋手的位置

IF 0.5 4区 数学 Q3 MATHEMATICS
A. Poddiakov
{"title":"非传递性地赢得棋手的位置","authors":"A. Poddiakov","doi":"10.1134/S1064562424702417","DOIUrl":null,"url":null,"abstract":"<p>Chess players’ positions in intransitive (rock-paper-scissors) relations are considered. Intransitivity of chess players’ positions means that: position A of White is preferable (it should be chosen if choice is possible) to position B of Black, if A and B are on a chessboard; position B of Black is preferable to position C of White, if B and C are on the chessboard; position C of White is preferable to position D of Black, if C and D are on the chessboard; but position D of Black is preferable to position A of White, if A and D are on the chessboard. Intransitivity of winningness of chess players’ positions is considered to be a consequence of complexity of the chess environment—in contrast with simpler games with transitive positions only. The space of relations between winningness of chess players’ positions is non-Euclidean. The Zermelo-von Neumann theorem is complemented by statements about possibility <i>vs</i>. impossibility of building pure winning strategies based on the assumption of transitivity of players’ positions. Questions about the possibility of intransitive players’ positions in other positional games are raised.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 2 supplement","pages":"S391 - S398"},"PeriodicalIF":0.5000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Intransitively Winning Chess Players’ Positions\",\"authors\":\"A. Poddiakov\",\"doi\":\"10.1134/S1064562424702417\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Chess players’ positions in intransitive (rock-paper-scissors) relations are considered. Intransitivity of chess players’ positions means that: position A of White is preferable (it should be chosen if choice is possible) to position B of Black, if A and B are on a chessboard; position B of Black is preferable to position C of White, if B and C are on the chessboard; position C of White is preferable to position D of Black, if C and D are on the chessboard; but position D of Black is preferable to position A of White, if A and D are on the chessboard. Intransitivity of winningness of chess players’ positions is considered to be a consequence of complexity of the chess environment—in contrast with simpler games with transitive positions only. The space of relations between winningness of chess players’ positions is non-Euclidean. The Zermelo-von Neumann theorem is complemented by statements about possibility <i>vs</i>. impossibility of building pure winning strategies based on the assumption of transitivity of players’ positions. Questions about the possibility of intransitive players’ positions in other positional games are raised.</p>\",\"PeriodicalId\":531,\"journal\":{\"name\":\"Doklady Mathematics\",\"volume\":\"110 2 supplement\",\"pages\":\"S391 - S398\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2025-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Doklady Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1064562424702417\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Mathematics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1134/S1064562424702417","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

象棋选手在不及物关系(石头-剪刀-布)中的位置被考虑。棋手位置的不可及性意味着:如果A和B在一个棋盘上,白棋的位置A比黑棋的位置B更可取(如果可能的话,应该选择A);如果棋盘上有B和C,黑棋的位置B比白棋的位置C更可取;如果棋盘上有C和D,白棋的C位置比黑棋的D位置更可取;但如果棋盘上有A和D,黑棋的D位置比白棋的A位置更可取。与只有传递位置的简单游戏相比,棋手获胜的非传递性被认为是国际象棋环境复杂性的结果。棋手的胜负关系空间是非欧几里得的。Zermelo-von Neumann定理还补充了基于玩家位置传递性假设而构建纯粹获胜策略的可能性与不可能性。对其他位置博弈中不及物棋手位置的可能性提出了疑问。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Intransitively Winning Chess Players’ Positions

Intransitively Winning Chess Players’ Positions

Chess players’ positions in intransitive (rock-paper-scissors) relations are considered. Intransitivity of chess players’ positions means that: position A of White is preferable (it should be chosen if choice is possible) to position B of Black, if A and B are on a chessboard; position B of Black is preferable to position C of White, if B and C are on the chessboard; position C of White is preferable to position D of Black, if C and D are on the chessboard; but position D of Black is preferable to position A of White, if A and D are on the chessboard. Intransitivity of winningness of chess players’ positions is considered to be a consequence of complexity of the chess environment—in contrast with simpler games with transitive positions only. The space of relations between winningness of chess players’ positions is non-Euclidean. The Zermelo-von Neumann theorem is complemented by statements about possibility vs. impossibility of building pure winning strategies based on the assumption of transitivity of players’ positions. Questions about the possibility of intransitive players’ positions in other positional games are raised.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Doklady Mathematics
Doklady Mathematics 数学-数学
CiteScore
1.00
自引率
16.70%
发文量
39
审稿时长
3-6 weeks
期刊介绍: Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信