Exercises 3134 concern the Markov chain model for scoring a tennis match described in Section 10.1, Exercise
Question:
Exercises 31–34 concern the Markov chain model for scoring a tennis match described in Section 10.1, Exercise 35. Suppose that players A and B are playing a tennis match, that the probability that player A wins any point is p D :6, and that the game is currently at “deuce.”
Find the probability that player A wins the game
Data From Section 10.1 Exercise 35
To win a game in tennis, one player must score four points and must also score at least two points more than his or her opponent. Thus if the two players have scored an equal number of points (four or more), which is called “deuce” in tennis jargon, one player must then score two points in a row to win the game. Suppose that players A and B are playing a game of tennis that is at deuce. If A wins the next point it is called “advantage A,” while if B wins the point it is “advantage B.” If the game is at advantage A and player A wins the next point, then player A wins the game. If player B wins the point at advantage A, the game is back at deuce.
Step by Step Answer:
Linear Algebra And Its Applications
ISBN: 9781292351216
6th Global Edition
Authors: David Lay, Steven Lay, Judi McDonald