.ce
TEST II
.nf
CS524                                            NAME___________________________
Instructor Dr P Juell                                      Jan 30, 1986
100 points
.fi
1. (??)
Number the nodes in the following tree indicating which noted are
visited in a alpha/beta search.  Also show the labeling of the tree
resulting from the alpha/beta search (with no extra labeling).
.nf
                                     o

                       o                             o

               o       o       o           o         o         o

          o    o  o  o o  o  o o  o     o  o   o   o  o  o   o  o  o

          4    3  2  5 0  2  8 0  1     9  1   2   3  2  8   9  8  0
.fi
.sp
2. (??)
Robbe Robot is programmed to find the top of a hill by using a hill
climbing algorithm.  Unfortently, since he is built from real (and cheep)
parts, there some limitations on the slopes he can travers and detect.
He is not able to take slopes any larger than .7 and he can not
detect slopes any less than .1
Explain problems these limitations will introduce in addition to the
normal problems assosiated with the hill climbing algorithm
or changes to the normal problems these will introduce.
.sp
3. (??)
A progam was designed to correctly classify the usage of
the word 'ball' as either:
.br
(1) a round solid object used as a toy
.br
(2) a formal dance
.br
Explain properties of 'ball', 'throw' and 'go' that would allow
the program to correctly handle the following sentences:
.sp
John threw the ball to Mary.
.br
John picked up the ball.
.br
Mary went to the ball.
.sp
Use the general form given in the book for showing the restictions.
.sp 2
4. (??)
Write a production system to determine if there is a path from
the SOURCE to the GOAL node.  There will be no cycles in the data.
An example starting STM is:
.sp
.nf
((GOAL A)(SOURCE C)(CONNECT A B)(CONNECT B C)(CONNECT A D)(CONNECT D E))
This representing the graph
           A
         /   \\
        B     D
        \|    \|
        C     E     F  <--note not connected to rest
.fi
This can be solved using any of the production systems discused, but
is to be solved for general input data.
AFTER you get something that would work, make sure it will stop.
HINT - Intermeadent answers are necisary.