TY - JOUR
T1 - A probabilistic two-pile game
AU - Leung, Ho Hon
AU - Thanatipanonda, Thotsaporn Aek
N1 - Publisher Copyright:
© 2019, University of Waterloo. All rights reserved.
PY - 2019
Y1 - 2019
N2 - We consider a game with two piles in which two players take turns adding a or b chips, randomly and independently, to their respective piles. Here a, b are not necessarily positive. The player who collects at least n chips first wins the game. We derive general formulas for pn, the probability of the second player winning the game by collecting n chips first, and give the calculation for the cases {a, b} = {−1, 1} and {−1, 2}. The latter case was considered by Wong and Xu. At the end, we derive a general formula for pn1,n2, the probability of the second player winning the game by collecting n2 chips before the first player collects n1 chips.
AB - We consider a game with two piles in which two players take turns adding a or b chips, randomly and independently, to their respective piles. Here a, b are not necessarily positive. The player who collects at least n chips first wins the game. We derive general formulas for pn, the probability of the second player winning the game by collecting n chips first, and give the calculation for the cases {a, b} = {−1, 1} and {−1, 2}. The latter case was considered by Wong and Xu. At the end, we derive a general formula for pn1,n2, the probability of the second player winning the game by collecting n2 chips before the first player collects n1 chips.
KW - Gosper’s algorithm
KW - Probability
KW - Take-away game
UR - http://www.scopus.com/inward/record.url?scp=85079446214&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85079446214&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:85079446214
SN - 1530-7638
VL - 22
JO - Journal of Integer Sequences
JF - Journal of Integer Sequences
IS - 4
M1 - 19.4.8
ER -