# Introduction to Artificial Inteligence

### Example Quiz 1

Justify all answers CONCISELY!
1) Which of the following is correct, for the cannibals and missionaries
search problem (with path cost being TOTAL NUMBER OF PEOPLE MOVED IN
EITHER DIRECTION):
a) Number of people on the wrong shore is an admissible heuristic
b) Number of people on the wrong shore is NOT an admissible heuristic
c) There is NO admissible heuristic for this problem
d) A function that always returns 0 is NOT an admissible heuristic here
2) Construct a taxonomic hierarchy for animals, which contains mammals, which
contain primates, which in turn contains apes and humans (which are
disjoint). Whales are
also mammals, which are not primates, and no primate is a whale. All whales
can swim. Jesus is a human who can walk on water, but cannot swim.
Anything that can swim has a fin. Juju is a whale.
a) Write down the axioms and facts for the above in FOPC
b) Prove or disprove (or argue that neither can be done):
1) Jesus has no fin
2) Jesus is a whale
3) Some animals can swim
4) Some primates cannot swim
5) If some primate can walk on water, then there are no primates.
3) Consider a 3-person game, with players A, B, C, where each ties
to maximize their OWN score (The value of a game position is a 3-tuple,
(value for A, value for B, value for C). The game is a move by A, a move by
B, and then a move by C, then repeat. Assuming that players do NOT
attempt to collaborate:
a) Write in pseudocode the optimal decision procedure for player A,
where you have a function that gives the exact value for terminal
game nodes.
b) What would happen if two players, say B and C, could make deals? Give
a specific example!