COMPSCI 171 Quiz: 04s-quiz-4-key
Document Summary
Ics 171 quiz #4 twenty (20) minutes: (5 pts) name and email address: From right: (25 pts max, -5 for each error, but not negative) mini-max search in game trees. The game tree below illustrates one position reached in the game. Inside each leaf node is the estimated score of that resulting position returned by the heuristic static evaluator. Cross out each leaf node that will not be examined. 4 2 6 9 8 7 0 6 9 7 1 6 9 8 8 1: (10 pts each, 30 pts total) assume that you have two text documents, d1 and d2, and a text query, q. Assume that similarity is computed using a simple dot product: sim(q, d) = pterm q w(term, q)w(term, d) Text document d1 term weights, w(term, d1) : Text document d2 term weights, w(term, d2) : Text query q term weights, w(term, q) :
