search method that attempts to choose the next e-node intelligently is code example Example: Which search is complete and optimal when h(n) is consistent? A* using graph-search is optimal