The game of Go is one of the most popular games in the world. When playing games like Go, players usually consider the following two questions at each position:How many points ahead is BLACK (WHITE)?How big is the next move?The strength of a Go player depends on his or her ability at answering these questions. The answers to these two questions, in terms of combinatorial game theory, are called the mean and temperature of a game and they come from the solution of a nested min-max equation. This article is intended to describe an algorithm for finding these values of a subclass of combinatorial games where each player can have only one option at each local non-terminal position.