logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

When Will (Game) Wars End?

delete2025-11-01
delete0
PRE
AI
M
Manan Bhatia *
B
Byron Chin
N
Nitya Mani
E
Elchanan Mossel
DOI：10.1080/00029890.2025.2572283delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We study several variants of the classical card game war. As anyone who has played this game knows, the game can take some time to terminate, but it usually does. Here, we analyze a number of asymptotic variants of the game, where the number of cards is n, and show that all have an expected termination time of order n2. This is the same expected termination time as the game where at each turn a fair coin toss decides which player wins a card, known as Gambler's Ruin and was studied by Blaise Pascal, Pierre de Fermat and others in the seventeenth century.
Keywords:
FINITENESS

Journal

A
American Mathematical Monthly
IF:
0.4
Papers:
111
Citations:
0

Organization

No organization information available