Guiding Monte Carlo Tree Search simulations through Bayesian Opponent Modeling in The Octagon Theory
Board games present a very challenging problem in the decision-making topic of Artificial Intelligence. Although classical tree search approaches have been successful in various board games, such as Chess, these approaches are still very limited by modern technology when applied to higher complexity...
| Autor principal: | |
|---|---|
| Formato: | masterThesis |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/67642 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/67642 |