a-star - Read For Learn

What is the difference between graph search and tree search?

Judging from the existing answers, there seems to be a lot of confusion about this concept. The Problem Is Always a Graph The distinction between tree search and graph search is not rooted in the fact whether the problem graph is a tree or a general graph. It is always assumed you’re dealing with a … Read more

Consistent and Admissible Heuristics

As Russel and Norvig point out in Artificial Intelligence: A Modern Approach (the most commonly used AI textbook) it is challenging to come up with a heuristic that is admissible but not consistent. Obviously, you can select values for nodes in a graph such that the heuristic they represent is admissible but not consistent. This … Read more