First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Massively multiplayer online computer games are played in complex, persistent virtual worlds. Over time, the landscape of these worlds evolves and changes as players create and pe...
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...