Expected length and probability of winning a tennis game

被引：0
|
作者：
Cooper, Curtis [1 ]
Kennedy, Robert E. [1 ]
机构：
[1] Univ Cent Missouri, Sch Comp Sci & Math, Warrensburg, MO 64093 USA
来源：
MATHEMATICAL GAZETTE | 2021年 / 105卷 / 564期
关键词：
D O I：
10.1017/mag.2021.117
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The game of tennis has provided mathematicians with many interesting problems. In [1], the problem of finding the probability that a certain player wins a tennis tournament was studied. Gale [2] determined the best serving strategy in tennis. First, we assume Alice and Bob play a game of tennis using the standard (or Deuce/Ad) scoring system, without a tiebreaker, and that Alice serves the game. We also assume that the probability that Alice wins any point she serves is. Stewart [3] proved that the probability that Alice wins is 'Equation Presented'. © 2021 The Mathematical Association.
引用
收藏
页码：490 / 500
页数：11
相关论文
共 50 条
12345