The papr shows how the probability of winning a game, a set and a match, depends on the probability of winning a ball (from one's own and from the oponent's serve). The conitions are given under which the usual serve strategy (strong-weak) is optimal. It is also shown that a game is “strategy-less” in the sense that if the player has k (=1, 2, or 3) balls which he can play with increased robability of winning, then all strtegies of placing these balls during the game are equivalent. Finally, it is shown that the last property does not carry over to the case of optimal strategy in a match.