학술

Computer-Assisted Results for $n$-Sided Non-Transitive Dice Taking Face Values in $[n]$

arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.

Abstract

We consider non-transitivity among dice with $n$ sides restricted to taking face values in the set $\{1,\ldots,n\}$.

We give a computer-assisted proof that $n=6$ is the smallest $n\ge3$ which admits a non-transitive cycle of maximum length $n$ with uniform and minimal winning advantage.

For $n=6$, we identify the two unique non-transitive cycles of length $6$.

We present computational evidence supporting a conjecture that $n=6$ is the largest $n\ge3$ which admits a non-transitive cycle of maximum length $n$ with uniform and minimal winning advantage.

관련 뉴스