27.MinMax-18

27.MinMax-18 - Min-Max Trees One other use of recursion is...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
One other use of recursion is a technique called backtracking. Backtracking essentially involves a recursive exhaustive search that tries to maximize a particular choice. A popular use of backtracking is in computer players of games, such as chess. The basic idea is as follows: when the computer is moving, it "tries" out all of its possible moves. It wants to pick the move which gives it the best advantage. One way to do this would be to look at each "answering" move the human player could make. Imagine that each of these moves had a score such that the higher the score, the more favorable the move is for the human player. Our goal as the computer of course, would be to minimize the score achieved by the human. We would naturally assume that the human makes its best possible move, ie. the maximum valued move of all of its possibilities. Thus, as the computer, we should pick the minimum of all of these maximums. Thus, the term mini-max tree is given to this sort of search. Consider the following diagram:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

27.MinMax-18 - Min-Max Trees One other use of recursion is...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online