Home * People * Markus Esser

Markus Esser,
a German computer scientist and software developer [1]. He holds a B.Sc. from Aachen University of Applied Sciences in 2010, and a M.Sc. in artificial intelligence from Maastricht University in 2012 on the topic of Best-Reply Search in multi-player games, for instance Four-player Chess, further elaborated at the Computer and Games 2013 conference in Yokohama.

Best-Reply Search

Abstract from the CG 2013 paper [2]
Best-Reply Search (BRS) is a new search technique for game-tree search in multi-player games. In BRS, the exponentially many possibilities that can be considered by opponent players is flattened so that only a single move, the best one among all opponents, is chosen. BRS has been shown to outperform the classic search techniques in several domains. However, BRS may consider invalid game states. In this paper, we improve the BRS search technique such that it preserves the proper turn order during the search and does not lead to invalid states. The new technique, BRS+, uses the move ordering to select moves at opponent nodes that are not searched. Empirically, we show that BRS+ significantly improves the performance of BRS in Four-Player Chess, leading to winning 8.3% to 11.1% more games against classic techniques maxn and Paranoid, respectively. When BRS+ plays against maxn , Paranoid, and BRS at once, it wins the most games as well.

Selected Publications

External Links


  1. ^ Markus Esser - Softwareentwickler - Soptim AG | XING
  2. ^ Markus Esser, Michael Gras, Mark Winands, Maarten Schadd, Marc Lanctot (2013). Improving Best-Reply Search. CG 2013, pdf

What links here?

Up one level