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