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

Info icon This 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?
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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern