.po 5
.nh
.ce
TEST II CS524
.nf
Instructor Dr P Juell                           NAME__________________________
100 points, open book                                      Feb 2, 1989
OPEN BOOK
.fi
.sp
1. (20)
Specify a game tree which will have at least one node not searched
by an alpha/beta search.

Re-order this tree so that all nodes would have to be searched by
an alpha/beta search.

2. (20)
At the bottom of the page
there are a number of copies of a figure.
Show the process of labeling the figure.  Use one copy of the figure
for each step. 

3. (20)
Robby Robot has signal intensity meter to help in finding a 
radio transmitter.
The closer Robby is to the transmitter, the stronger the signal is.
Unfortunely at some points it does not receive any signal. 
When it does receive a signal, 
it can correctly give the signal's strength.
Explain a standard technique or a modification to a standard technique
for finding the transmitter.

4. (20)
A new type of worm has been found.  It starts life as a female.  It is female
for two weeks then turns into a male for two weeks and then dies.  
Females can mate with a male producing one offspring in one week.  
Describe this with a PROS program.  Start you STM with an first week female
and a first week male.  Show the first four STM's (including the starting one).

5. (20)
chronological backtracking 
dependency directed backtracking 
Why is dependency directed backtracking normally faster than chronological
backtracking.

Give a situation where dependency directed backtracking would take 
the same time or more than chronological backtracking.