A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games
{{output}}
Due to their complex dynamics, combinatorial games are a key test case and application for algorithms that train game playing agents. Among those algorithms that train using self-play are coevolutionary algorithms (CoEAs). However, the successful application o... ...
