In computer go, the goal is to find a good move in a given position by exploring the associated game tree, which is far too large to enumerate and hence requires sophisticated methods for navigation.
