本文举例介绍递推法在解决概率问题中 的应用. 例题 有人玩硬币走跳棋的游戏.已知硬 币出现正、反面的概率都是0.5,棋盘上标有第 0站、第1站、第2站、…、第100站.一枚棋子 开始在第0站,棋手每掷一次硬币,棋子向前跳 动一次,若掷出正面,棋子向前跳一站,若掷出 反面,则棋子向前跳两站,直到棋子跳到第99 站(胜利大本营)或第100站(失败大本营)时, 该游戏结束.求此人玩该游戏获胜的概率. This article gives an example of the application of the recursive method in solving the problem of probability. Example: Someone is playing a game of coins and checkers. The probability of a known coin being both positive and negative is 0.5. The board is marked with station 0, station 1, station 2 Station, ..., 100th station. A pawn starts at the 0th station. Each time the player throws a coin, the player moves forward one time. If the front is thrown, the player jumps forward one stop. If the opposite side is thrown, the player will Jump two stops before the game until the pawn jumps to the 99th station (Victory Base Camp) or the 100th station (Failed Base Camp). The game is over. Ask this person to play the game and the probability of winning.