A General Solution to the Graph History Interaction Problem

Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by a large margin. However, it suffers from the so-called Graph History Interaction (GHI) problem, which causes errors in games containing repeated positions. This paper presents a practical solution to the GHI problem by combining and extending previous methods. Because our scheme is general, it is applicable to different game tree search algorithms and to different domains. As demonstrated with the two algorithms

• Type: Conference
• Year: 2004
• Where: AAAI
• Authors: Akihiro Kishimoto, Martin Müller 0003
• Keywords: AAAI 2004, Directed Graph, Intelligent Agents, So-called Graph History, Tree Search Algorithms