Which searching strategy among the following is used to expand the lowest evaluated node for first expansion? 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