Search the tree to the end Assign utility values to terminal nodes
Find the best move for MAX (this is MAX's turn) assuming: MAX will make the move that maximizes utility MIN will make the move that minimizes utility
MAX should make the rightmost move.