On a dart game of Niedermaier

DOI10.1016/J.AAM.2023.102483MaRDI QIDQ2687280zbMATH OpenOpenAlexFDO

Authors Sergi Elizalde

Publication date 1 March 2023

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2209.03775

zbMATH Keywords

dart gameleft-to-right minimumStirling numberwinning probability

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Bell and Stirling numbers (11B73) Combinatorial probability (60C05) Combinatorial games (91A46) Trade models (91B60)

Abstract: We analyze a game introduced by Andy Niedermaier, where $p$ players take turns throwing a dart at a dartboard. A player is eliminated unless his dart lands closer to the center than all previously thrown darts, in which case he goes to the back of the line, until only one player remains. Using generating functions, we determine the distribution of the number of throws in the game, and we obtain a recursive formula to compute the probability that each player wins.

Recommendations

• scientific article; zbMATH DE number 58015
• A probabilistic analysis of the Game of the Goose
• scientific article; zbMATH DE number 3978021
• How to play Dundee.
• Where to stand when playing darts?

Cites work

• Analytic combinatorics
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)

Cited in

(4)

• scientific article; zbMATH DE number 58015 (Why is no real title available?)
• scientific article; zbMATH DE number 1409197 (Why is no real title available?)
• Where to stand when playing darts?
• Dartboard arrangements

This page was built for publication: On a dart game of Niedermaier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687280)