Please let me know if this is not appropriate question to ask here (I hope not but afraid since this isn't really theoretical question).
In the book "Artificial Intelligence Modern Approach" (Russell, Norvig) 3rd ed., in Figure 3.14 in page 84, is the 2nd last line error (this is not on current errata) ?
else if child.State is in frontier with higher PATH-COST then replace that frontier node with child
My guess is:
else if child.State is in frontier with lower PATH-COST then replace that frontier node with child
This is pseudocode for Un-informed, breadth search, where the search candidates are in a list called
frontier, which is lower ordered by
PATH-COST. I wonder the suspected code would update the list with the node with higher cost.
Correct me if I'm wrong. Thank you.