• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Articles
  • Intransitively winning chess players’ positions
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2028
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
October 8, 2026
HSE Experts Take Part in 23rd Annual Meeting of Valdai Discussion Club
The 23rd Annual Meeting of the Valdai Discussion Club was held from September 28 to October 1, 2026 under the theme ‘Responsibility for the Future: Limits of the Possible, or Limitless Possibilities?’ The forum brought together 120 experts from 40 countries, including representatives of China, the United States, India, Brazil, the United Kingdom, Germany, Egypt, Iran, and Japan.
October 7, 2026
‘Our Team Consists of True Leaders in Their Respective Academic Disciplines
The HSE International Centre of Decision Choice and Analysis studies a wide range of methods for analysing decision-making and possible scenarios for the development of natural, socio-economic, and political phenomena using various mathematical models. The application of advanced mathematical methods to forecasting helps to prevent negative outcomes and avoid erroneous decisions. The HSE News Service spoke to the centre’s director, Prof. Fuad Aleskerov, about its work.
October 6, 2026
International N5 Symposium ‘Neural Networks and Nonlinearity in Nizhny Novgorod Brings Together Scientists from Russia and Serbia
The International N5 Symposium ‘Neural Networks and Nonlinearity in Nizhny Novgorod’ was held at the Nizhny Novgorod House of Scientists from September 23 to 26. The event was organised by HSE University–Nizhny Novgorod and the Nizhny Novgorod House of Scientists, with the participation of Sberbank and the Institute of Physics Belgrade. The symposium was held for the second time: the first conference took place in 2025 and attracted considerable interest from the academic community.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Intransitively winning chess players’ positions

Doklady Mathematics. 2024. Vol. 110. No. Suppl 2. P. S391–S398.
Poddiakov A.

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.

Research target: Mathematics Computer Science
Language: English
DOI
Text on another site
Keywords: chesscombinatorial game theoryChess-like gamesintransitivity of superiorityintransitively winning chess players’ positions
Similar publications
Automated Ranking of Soybean Plots from Close-Range RGB Video via Depth Filtering and Point-Based Counting
Groshev Maksim, Rybakov Petr, Teterin N. et al., Sensors 2026 Article 6171
Manual assessment of soybean yield components, such as pod number, is laborious, time-consuming, and subjective. Existing computer-vision approaches based on object detection or instance segmentation perform poorly on close-range RGB imagery of soybean canopies due to severe occlusions, ambiguous plant boundaries, and the high cost of bounding-box annotation. To address these challenges, we propose a ...
Added: October 7, 2026
Space-Time Fluctuations in a Quasi-static Limit
Bernardin C., Gonçalves P., Olla S., Mathematical Physics Analysis and Geometry 2024 Vol. 27 No. 7
We consider the macroscopic limit for the space-time density fluctuations in the open symmetric simple exclusion in the quasi-static scaling limit. We prove that the distribution of these fluctuations converge to a gaussian space-time field that is delta correlated in time but with long-range correlations in space. ...
Added: October 6, 2026
Новые информационные технологии в исследовании сложных структур. Материалы шестнадцатой международной конференции 21–25 Сентября 2026 г.
Томск: Издательство Томского государственного университета, 2026.
Материалы сборника Шестнадцатой Международной конференции «Новые информационные технологии в исследовании сложных структур» (Москва, 21–25 сентября 2026 г.) ориентированы на широкий круг специалистов, работающих на стыке теории информации, системного анализа и прикладных предметных областей. В издание вошли результаты исследований, посвящённые моделированию дискретных и стохастических структур управления и связи, разработке высокопроизводительных вычислительных и телекоммуникационных систем, а также вопросам цифровой трансформации образования, архитектурно-градостроительного проектирования,  экологического ...
Added: October 6, 2026
To spike or not to spike: the whims of the Wonham filter in the strong noise regime
Bernardin C., Chhaibi R., Najnudel J. et al., Probability Theory and Related Fields 2026 Vol. 195 P. 1823–1875
We study the celebrated Shiryaev-Wonham filter (Wonham, W.M., in J. Soc. Ind. Appl. Math. 347–369, 1964) in its historical setup, where the hidden Markov jump process has two states. We are interested in the weak noise regime for the observation equation. Interestingly, this becomes a strong noise regime for the filtering equations. Earlier results of ...
Added: October 5, 2026
Цепная дробь Аски–Вильсона при qN=1
Ismailov A., Spiridonov V., Успехи математических наук 2026 Т. 81 № 5 С. 183–184
Получена новая формула для цепной дроби Аски–Вильсона в форме отношения двух  q-гипер-геометрических рядов. ...
Added: October 5, 2026
Оптимизация энергопотребления предприятия с использованием методов многокритериальной оптимизации
Серебренников Д. А., Belov A. V., Информационные технологии и вычислительные системы 2026 № 3 С. 157–169
В условиях роста стоимости энергоресурсов и необходимости повышения энергоэффективности производственных процессов особую актуальность приобретает задача оптимизации энергопотребления промышленных предприятий. В данной работе рассматривается подход к управлению энергозатратами машиностроительного предприятия на основе методов многокритериальной оптимизации. Постановка задачи включает несколько целевых функций: минимизацию энергопотребления, минимизацию стоимости электроэнергии с учётом тарифных ограничений и максимизацию производственной эффективности. Для решения ...
Added: October 5, 2026
Explicit Formula for Inverse and Determinant in Geometric Algebras over Odd-dimensional Vector Spaces
Abdulkhaev K., Shirokov D., Advances in Applied Clifford Algebras 2026 Vol. 36 P. 1–21
In this paper, we present explicit formulas for the inverse and determinant in geometric (Clifford) algebras over vector spaces of dimension n = 7. The derivation of these formulas is made possible by generalizing the concept of conjugation to basis conjugation operations. We further develop a general method for constructing such formulas over odd-dimensional spaces ...
Added: October 4, 2026
On Practical Aspects of Constructing Quasi-Cyclic Subfield Subcodes of Dual Elliptic Codes and Their Application in McEliece-type Cryptosystems
Kuninets A., IEEE Transactions on Information Theory 2026 P. 1–1
In this work we study the applicability of Quasi-Cyclic Subfield Subcodes of Dual Elliptic (QC-SSDE) codes for integration into code-based cryptographic schemes. Detailed algorithms are provided for constructing parity-check matrices as well as block-circulant parity-check matrices for this family of codes, accompanied by empirical results that enable the construction of QC-SSDE codes with predetermined dimensions. ...
Added: October 3, 2026
Инкрементальный метод обновления многомерного куба по неупорядоченному потоку событий журналов информационных систем
Zykov S. V., Уфимцев Г. А., Моделирование, оптимизация и информационные технологии 2026 Т. 14 № 8 С. 1–13
Информационные системы формируют большие объёмы событийных журналов, которые используются для анализа работы приложений и сервисов. При этом события могут поступать в аналитический контур позже момента их фактического возникновения и не в исходном порядке. Такая рассинхронизация приводит к ошибкам при построении агрегированных временных показателей, а регулярный полный пересчёт многомерного аналитического куба требует значительных вычислительных затрат. Целью ...
Added: October 2, 2026
Polarization of opinions in the group: a modeling algorithm considering the dynamics of social bonds
Chebotarev V., Andreyuk D., Elizarova Anastasiya et al., Procedia Computer Science 2022 Vol. 213 No. C P. 596–601
The dynamics of opinion in a group are of interest for a number of practical purposes. In particular, consensus helps and polarization of opinions hinders cohesive teamwork. Existing approaches for modeling opinion dynamics mostly do not take into account the dynamism of social relations in a group. This paper proposes an algorithm and a program ...
Added: October 2, 2026
Enhancing Boundary Stability in Decision Trees and Random Forests: A Weighted Sample Duplication Approach
Konstantinov A., Elizarova Anastasiya P., Utkin L., Computing, Telecommunications and Control 2026 Vol. 19 No. 1 P. 16–25
Decision trees and their ensemble extensions, such as random forests, are widely used as classification models due to their simplicity and interpretability. However, in many real-world tasks where class labels overlap in the feature space, standard decision trees rely on hard splits that create fragile decision boundaries. In these regions, small perturbations in the input ...
Added: October 2, 2026
Graphon spin systems as exactly solvable models
Medvedev G., Alexandrov Artem, Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 2026 Vol. 114 Article 044102
Graphons are measurable functions used to describe the asymptotic behavior of convergent graph families. Originally motivated by problems in combinatorics and graph theory, graphons have found numerous applications in the modeling and analysis of dynamical processes on networks. In this work, we use graphons to formulate the Ising model on convergent graph sequences, which include ...
Added: October 2, 2026
You shall know a piece by the company it keeps. Chess plays as a data for word2vec models
Orekhov B., / Series Computer Science "arxiv.org". 2024.
In this paper, I apply linguistic methods of analysis to non-linguistic data, chess plays, metaphorically equating one with the other and seeking analogies. Chess game notations are also a kind of text, and one can consider the records of moves or positions of pieces as words and statements in a certain language. In this article ...
Added: August 8, 2024
Do Mistakes Provoke New Mistakes? Evidence from Chess
Adhikari A., Anatolyev S., Dagaev D., IEEE TRANSACTIONS ON GAMES 2024 Vol. 16 No. 2 P. 483–488
We investigate how the mistakes of professional chess players affect the quality of their further moves in the same game. Using a database of games played by top chess players, Stockfish chess engine evaluations, and an ordered probit regression analysis, we found clear evidence that most mistakes provoke tilt, which leads to less accurate future play, ...
Added: May 8, 2023
Intransitivity and meta-intransitivity: meta-dice, levers and other opportunities
Poddiakov A., Lebedev A., European Journal of Mathematics 2023 Vol. 9 Article 27
Various objects and systems in intransitive relations of superiority (“rock-paper-scissors” relations) are described (intransitive sets of sticks, dice, chess positions, machines, biological species etc.). The concept of meta-intransitivity of superiority is introduced. Meta-intransitivity is a property of systems, which are in intransitive relationships between one another, and, at the same time, each of them contains ...
Added: April 12, 2023
Learning intransitivity: from intransitive geometrical objects to "rhizomatic" intransitivity
Poddiakov A., , in: Proceedings of the PME and Yandex Russian conference: Technology and Psychology for Mathematics Education.: M.: SU HSE Publishing House, 2019. P. 178–185.
Added: January 3, 2020
Intransitive machines
Poddiakov A., / Series arXiv "math". 2018. No. 1809.03869.
The intransitive cycle of superiority is characterized by such binary relations between A, B, and C that A is superior to B, B is superior to C, and C is superior to A (i.e., A>B>C>A—in contrast with transitive relations A>B>C). The first part of the article presents a brief review of studies of intransitive cycles ...
Added: September 12, 2018
Нетранзитивность выигрышности шахматных позиций и ее следствия для теории игр и эпистемологии
Poddiakov A., В кн.: Психология когнитивных процессов.: Смоленск: СмолГУ, 2017. С. 52–57.
Nontransitivity of winningness of chess arrangements (i.e., their relations like in the rock-paper-scissors game) is recently found property of chess environment. The concept of interactivity of a game, i.e., extent of its parties’ interaction (interpenetration) is introduced. Games of different interactivity are analyzed, and nontransitivity is considered as a consequence of high interactivity. Consequences of ...
Added: June 19, 2017
Нетранзитивность превосходства и ее использование для обмана и тренировки мышления
Poddiakov A., Психолого-экономические исследования 2016 Т. 3 (9) № 4 С. 43–50
Knowledge from different areas (from mathematics to biology and social and economic psychology) is integrated to show that intransitive relations of superiority (like in Rock-Paper-Scissors game) are a wide-spread law in many complex systems. Its ignoring with “blind” following the principle of transitivity (if A>B and B>C then A>С) increases probability of some kinds of ...
Added: January 23, 2017
On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost
Gurvich V., Oudalov V., Discrete Applied Mathematics 2014 Vol. 167 P. 131–143
We study existence of Nash equilibria (NE) in pure stationary strategies in n-person positional games with no moves of chance, with perfect information, and with the mean or total effective cost function. We construct a NE-free three-person game with positive local costs, thus disproving the conjecture suggested in Boros and Gurvich (2003). Still, the following four problems ...
Added: October 22, 2016
The Diameter of Chess Grows Exponentially
Shitov Y., American Mathematical Monthly 2016 Vol. 123 No. 1 P. 71–77
We present an infinite sequence of pairs (An, Bn) of chess positions on an n × n board such that (1) there is a legal sequence of chess moves leading from An to Bn and (2) any legal sequence leading from An to Bn contains at least exp(n + o(n)) moves. ...
Added: February 23, 2016
Chess God's number grows exponentially
Shitov Y., / Series math "arxiv.org". 2014. No. 1409.1530.
We give an example of two n-by-n chess positions, A and B, such that (1) there is a sequence of legal chess moves leading from A to B; (2) the length of this sequence cannot be less than exp(cn). ...
Added: October 30, 2014
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit