Exact and Monte-Carlo algorithms for combinatorial games
This thesis concerns combinatorial games and algorithms that can be used to play them.Basic definitions and results about combinatorial games are covered, and an implementation of the minimax algorithm with alpha-beta pruning is presented.Following this, we give a description and implementation of t...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Umeå universitet, Institutionen för fysik
2014
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-88363 |