Fredrik H.

While there is a broad theoretic foundation for creating computational players for two-player games, such as Chess, the multi-player domain is not as well explored. We make an attempt to apply a multi-agent approach to a multi-player game with huge search spaces and multiple adversaries, namely no-press Diplomacy. We tested our solution against other available bots in an open competition and show that our solution outperforms its competitors in score while being competitive in speed.