Quiz2 - You opponent 4.Yes or no alpha-beta pruning is an...

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

View Full Document Right Arrow Icon
CSCI 561 Fall 2010 Quiz 2 answers 1.Yes or no: Bi-directional search can be used on all problems DFS and BFS can be used on. No. 2.Yes or no: For A*, an admissible heuristic is one which is always as large as or larger than the true distance/cost to the goal. No. 3.In mini-max search, who tries to minimize the utility: you or your opponent?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: You opponent. 4.Yes or no: alpha-beta pruning is an approximation of mini-max search. No. (alpha-beta pruning is exactly like mini-max, except it prunes -- it returns the exact same answer)...
View Full Document

This note was uploaded on 10/01/2010 for the course CSCI 561 at USC.

Ask a homework question - tutors are online