title: Which AI algorithms can be used to play probabilistic games with possibly incomplete information?
body: <p>The minimax algorithm and Monte-Carlo tree search (MCTS) can be used to implement agents which play deterministic (i.e., non-probabilistic) games, like chess or tic-tac-toe, that have complete information of the game.</p>
  
  <p>Are there general methods that work for games with incomplete information and/or games with a probabilistic component (e.g., poker or bridge)?</p>