Monte Carlo Tree Search for games with hidden information and uncertainty
Monte Carlo Tree Search (MCTS) is an AI technique that has been successfully applied to many deterministic games of perfect information, leading to large advances in a number of domains, such as Go and General Game Playing. Imperfect information games are less well studied in the field of AI despite...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of York
2014
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.638997 |