computer science - artificial intelligence help needed!

gopunk

Lifer
Jul 7, 2001
29,239
2
0
how can a heuristic be admissable (never give an overestimate) but NOT consistent?

definition of consistency:

h(n) is consistent if, for every node n and every successor n' of n generated by any action a, the estimated cost of reachin ghte goal from n is no greater than the step cost of getting to n' plus the estimated cost of reaching the goal from n'





this isn't a hw question, just fyi :)
 

GhettoFob

Diamond Member
Apr 27, 2001
6,800
0
76
I remember this stuff from the ai class I took, it made my head hurt...:confused:
 

dopcombo

Golden Member
Nov 14, 2000
1,394
0
0
Yeah I remember AI class as well.
After game theory lessons ended, and the other stuff started, I started understanding less and less of what the prof had to say.

But the prof sure was rich though. A different Polo Ralph Shirt everyday for a month at least :p
 

gopunk

Lifer
Jul 7, 2001
29,239
2
0
ah ok thanks for the help guys... i figured it out in the end... heh. just one of those things i had to think about for a while.