.po +7
.ce 
TEST II CS524 
.nf 
Instructor Dr P Juell                           NAME__________________________ 
100 points, open book                                      Feb 1, 19854 
.fi 
.sp 
1. (20) 
You have in the computer a network representing all of the 
highways in the US. You are starting at point A and are to go 
to point B.  If you reach point B you can tell you have reached 
your goal. 
For each point the x y coordinate of the point is available  
(also known as the latitude and longitude). 
Specify a way of using the idea of hill climbing to find a path 
from point A to point B.  You do know the coordinates of both A 
and B when you start. 
Since the needed path may not be the most direct, specify how 
you could guaranty you will find a path if there is one. 
Identify concepts/tools with the proper terms from the book (or class). 
Be sure to find such a path without being stuck in infinite 
loops. 
.sp  
2. (20) 
Show the steps in labeling the figure on the following page. 
Assume the trihedral restrictions. 
Use one figure for each step. 
.sp 
3. (20) 
In a game with alteration of play, player 1 is trying to win and 
player two is trying have player one win (as much as possible). 
Is there some simple adjustment to the alpha/beta system so that 
it can be used in this environment? 
.br 
If so, specify the changes, if not (briefly) explain why not. 
.sp 
4. (20) 
The following are rules for a program to be written using the PROS production 
system.  Write a program to perform the specified actions. 
.br 
STM can contain any number of A or B items. Leave in STM one C for each A 
more than there are B's or for each B more than there are A's. 
Do not leave 
any A's or B's in STM. 
.sp 
5. (20) 
Contrast the passing of control in the LISP blocks system you modified
and the PROS based block system discussed in class.  (identify concepts with
terms from the book or lecture)