IDAStar first adds a neighboring node to the path, checks if this node is a goal and if so returns is as an optimal solution. However, IDAStar did not make sure that the solution cost is not larger than the current bound, which could lead to sub-optimal solutions; this fix address that issue by adding the missing condition.
IDAStar first adds a neighboring node to the path, checks if this node is a goal and if so returns is as an optimal solution. However, IDAStar did not make sure that the solution cost is not larger than the current bound, which could lead to sub-optimal solutions; this fix address that issue by adding the missing condition.