Thursday, February 11, 2010

Minimax search procedure

The Minimax search procedure is of the depth-first search procedure type. The basic idea behind this procedure is to start at the current position and then use the plausible-move generator to produce the set of feasible successor positions. We then apply the static evaluation function to these positions and choose the best among them. We then back this value to the starting positions is as good as our next position. The basic assumption for all these is that our evaluation function will return a maximum value because that our goal.

No comments: