Search lesson

Here are some problems.

If we define f(A)=10 and f(B)=11 in the example from the lecture , then f seems to be not optimistic, but monotone. How is that possible?

After last lecture a student asked for a proof that monotonicity implies that when you find a node it it by the shortest path. Here is a proof from Nils Nilsson's book Principles of Artificial intelligence.


Last modified: Mon Sep 14 12:49:45 MEST 2009