Unformatted text preview: and S is essentially zero. The really expensive
calculation is move generation, the process that generates the b branches beneath a given node, which
takes time M per node processed. For a tree of depth d and branching factor b, what is the time required
for all the move generations, at every level in which moves are generated, given no alpha-beta or
extended-list pruning: Explain briefly: 3 Problem 2: Constraint Propagation (50 points) You just bought a 6-sided table (because it looks like a benzene ring) and want to hold a dinner
party. You invite your 4 best friends: McCain, Obama, Biden and Palin. Luckily a moose wanders
by and also accepts your invitation. Counting yourself, you have 6 guests for seats labeled 1-6.
2 6 3 5
4 Your guests have seven seating demands:
● Palin wants to sit next to McCain
Biden wants to sit next to Obama
Neither McCain nor Palin will sit next to Obama or Biden
Neither Obama nor Biden will sit next to McCain or Palin
The moose is afraid to sit next to Palin
No two people can sit in the same seat, and no one can sit in 2 seats.
McCain insists on sitting in seat 1 4 Part A (...
View Full Document
- Fall '10
- Artificial Intelligence, United States presidential election, 2008, McCain, Minimax, Biden, Palin