Learning in Bebe 1 2

Abstract

Determinism in chess programs implies the risk of repeating one’s losses when the opponent copies a previous winning sequence of moves. Preserving the transposition table between games counters this effect by disconcerting opponents. In order to have efficient action against repeating successful lines, a form of long-term memory is introduced, making the program’s experience heritable in the longer run. This paper provides a partially affirmative answer to the question whether this technique is effective: in crude terms it is in many games against the same opponent and it cannot be determined what its effects are against dissimilar opponents.