2. The search strategy will select the best expansion node at first for evaluation? * code example
Example: Which search is complete and optimal when h(n) is consistent?
A* using graph-search is optimal
A* using graph-search is optimal