SearchSkip to Search Results
- 6Monte-carlo tree search
- 2Artificial Intelligence
- 2Artificial intelligence
Algorithmic decipherment is a prime example of a truly unsupervised problem. This thesis presents several algorithms developed for the purpose of decrypting unknown alphabetic scripts representing unknown languages. We assume that symbols in scripts which contain no more than a few dozen unique...
Real-time strategy (RTS) video games are known for being one of the most complex and strategic games for humans to play. With a unique combination of strategic thinking and dexterous mouse movements, RTS games make for a very intense and exciting game-play experience. In recent years the games AI...
Properly planning module installation on industrial sites is a critical factor in ensuring that projects are delivered safely, on time, and within budget. In industrial modular construction, pre-fabricated modules are installed on site, in specific patterns, based on design documents. Depending...
The game of Hex is of interest to the mathematics, algorithms, and artificial intelligence communities. It is a classical PSPACE-complete problem, and its invention is intrinsically tied to the Four Colour Theorem and the well-known strategy-stealing argument. Nash, Shannon, Tarjan, and Berge are...
In this thesis, I study the problem of Monte-Carlo Planning in deterministic do- mains with sparse rewards. A popular algorithm in this suite, UCT, is studied. A new algorithm to incorporate state generalization in UCT using estimates of sim- ilar nodes and a distance metric is presented. The...
Given nothing but the generative model of the environment, Monte Carlo Tree Search techniques have recently shown spectacular results on domains previously thought to be intractable. In this thesis we try to develop generic techniques for temporal abstraction inside MCTS that would allow the...