quiz2_2009

# In particular which lecturer do you now assign a time

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , you need not hand this sheet in. You may use the following alpha-beta mini-max pseudo code as a reference: alpha_beta_search(node, alpha = -infinity, beta = +infinity) v = max_value(node, alpha, beta) return the action associated with v max_value(node, alpha, beta) if is_leaf(node) return static_value(node) v = -infinity for child in children(node): v = MAX(v, min-value(child, alpha, beta)) if v >= beta return v alpha = MAX(alpha, v) return v min-value(node, alpha, beta) if is_leaf(node) return static_value(node) v = +infinity for child in children(node): v = MIN (v, max-value(child, alpha, beta)) if v <= alpha return v beta = MIN(beta, v) return v Problem 1, part A MAX MIN MAX MIN 13 Probem 1, part B1 MAX MIN MAX MIN Problem 2, part A 14...
View Full Document

## This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.

Ask a homework question - tutors are online