.po 5
.nh
.ce
TEST II CS524
.nf
Instructor Dr P Juell                           NAME__________________________
100 points, open book                                      Jan 29, 1987
OPEN BOOK
.fi
.sp
1. (20)
Give a game tree that alpha/beta will not limit the search at all.
There must be at least one choice for each player with at least two options.
.sp
2. (20)
Write a program in pros to mimic the following information:
.in +5
.sp
Start the world with two male cubs and one female cub.
.br
If there is a male and female leopard they will produce one male and one
female cub.
.br
Cubs turn into adults.
.br
If there two male leopards one will be driven off.
.br
Female leopards will not mate if there are more than one adult males.
.in -5
.sp
Show the first four (including the first) stm's.
.sp
3. (20)
You are searching a tree for maximal return.  You have a function 'f'
which will give a value strictly proportional to the return of the subtrees
bellow the current node.  Explain how you would preform a search using
the function 'f'.
.sp
Is there another name for the above search?
.sp
When would rather not use the function 'f' even if it gives exact values
for the return for individual subtrees?
.sp
4. (20)
You are searching for a point called 'goal'.  You have a function 'd'
which tells you how far you are from 'goal'.  If you need a function 'h' 
for hill climbing how would you calculate h?
.sp
What would the 'hill' look like?
.sp
5. (20)
What is the relationship between search and backtracking?
.sp


.sp
-----------------------------------------------------
.br
THOUGHT QUESTION - NOT PART OF TEST
.br
How could you get a function 'f' for problem 3 that would be exact?