Example

Let MaxNodes = 3

• Initially B and G are added to open list, then hit max.
• B is larger f value, so discard but save f(B)=15 at parent A
  Add H, but f(H)=18. This is not a goal and we can never go deeper, so set f(H)=infinity and save at G.
• Generate next child I with f(I)=24, bigger other child of A. Now we have seen all children of G, so reset f(G) to 24.
• Regenerate B and child C. This is not a goal so f(C) is reset to infinity.
• Generate second child D with f(D)=20, backing up value to ancestors.
• D is a goal node, so search terminates.