A strategy based on probability theory for poker game

Poker game is one of the man-machine games with incomplete information. This paper presents a search strategy for poker game based on the theories of probability and game tree. It estimates every possible strategy opponents made in one round on the basis of the existing information and constructs a game tree. And then it computes the probability of realizing the purpose of playing this card at each turn based on the game tree and probability theory. According to this information, it determines the strategy at each round and constructs a game tree with weights. In this tree, each node represents one round, and the weight on each node represents the probability of getting the right of playing the card at first in the next round. The route from the root to each leaf shows a complete strategy, and the product of weights at each route gives the probability of success using this strategy. Finally, it finds an effective strategy through comparing the probability of success at each route.