CAP 4630 Introduction to AI (2009 Spring)
Homework 3 (12 pts)
Due: 03/23/2009
Question 1: Describe Hill-Climbing Search (0.5 pt), please explain why standard hill-
climbing algorithm suffer from the local maxima (or local minima) problem (0.5 pt)
Question 2: Describe local beam search (0.5 pt), if k=1, which search method is the local
beam search is equivalent to (0.5 pt)?
Question 3: Describe simulated annealing search (0.5 pt), if T=0 at all times, which
search method is the simulated annealing search equivalent to (0.5 pt)?
Question 4: Describe genetic algorithm search (1 pt). Assume you were asked to place 8
queens on an 8x8 chessboard such that no two queens can attack each other (i.e. share the
same row, column, or diagonal). The chromosome (representing an individual) and
crossover for the 8-queens problem shown in the class generate chromosomes with
exactly one queen per column, but often more than one queens (or none) per row.
Propose a chromosome representation and crossover and mutation mechanisms that
generate result in exactly one queen per column and one queen per row (1 pt).
Question 5: In Mini-max search, what do we assume about our opponent (0.5 pt), given a
two-ply game tree in Figure 1, starting from the root node, please list the nodes in the
order they are visited by the Mini-max search (0.5 pt) please show the utility values of
every node (0.5 pt).
Question 6: Given a two-ply game tree in Figure 1, starting from the root node, please
list the nodes in the order they are visited by α-β pruning (1 pt) please show the utility
values of every node (1 pt), and report the nodes which are pruned by α-β pruning (0.5 pt)
