Consistent Heuristics
A function that estimates the distance to the goal from a given state. 
- Always at most equal to the estimated distance from any neighboring vertex plus the cost to get to that vertex
Important Review on Graphs Algorithms 
Dijikstra's (uniform cost search) algorithm: works when edges are non-negative.
DFS: assumes all edge costs are zero
BFS: assumes all edge costs are the same 
Dynamic programming: works when graph is acyclic 
N-gram: Common Problem in NLP
Basically given n words, find the probability that a word w is the n+1 word. 
   Login to remove ads X
Feedback | How-To