|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Winter 2011 Multiplayer Search Algorithms and Strategies Benjamin Franks 
ABSTRACT Multiplayer Artificial Intelligence algorithms are not a well-studied area. The goal of this project was to establish a framework in which algorithms could be compared against one another. Three competing algorithms were selected: maxn, paranoid and best-reply search (BRS). The framework on which these algorithms are designed to compete is a version of Chinese Checkers. Three different boards have been developed to compare results. The framework is written in the Java programming language. The outcomes of some simulated scenarios show that the BRS tends to excel when facing multiple maxn opponents, while also doing very well against paranoid opponents. The board on which the game takes place also appears to have an effect on the outcomes, although more study is needed. |
||||||
|
