Intransitively winning chess players positions

December 11, 2022 Β· Declared Dead Β· πŸ› Doklady. Mathematics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alexander Poddiakov arXiv ID 2212.11069 Category math.HO Cross-listed cs.AI Citations 3 Venue Doklady. Mathematics Last Checked 3 months ago
Abstract
Positions of chess players in intransitive (rock-paper-scissors) relations are considered. Namely, position A of White is preferable (it should be chosen if choice is possible) to position B of Black, position B of Black is preferable to position C of White, position C of White is preferable to position D of Black, but position D of Black is preferable to position A of White. Intransitivity of winningness of positions of chess players 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 positions of chess players 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 positions of chess players. Questions about the possibility of intransitive positions of players in other positional games are raised.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.HO

R.I.P. πŸ‘» Ghosted

The mathematics of Bitcoin

Cyril Grunspan, Ricardo PΓ©rez-Marco

math.HO πŸ› EMS Newsletter πŸ“š 20 cites 6 years ago

Died the same way β€” πŸ‘» Ghosted