Games and Minimax Values

This chapter introduces some basic concepts of games. Finite zero-sum two-person perfect information games, for which our theory is to be developed, are introduced first. These games are represented by special graphs, called game graphs. If nodes representing the same game position in a conventional game tree are merged into only one node, then the merged graph is called a game graph. Two examples are used to clarify the discussion.