© 2000 Todd Neller.  A.I.M.A. text figures © 1995 Prentice Hall.  Used by permission.
SRBFS
•SRBFS (node : N, bound : B)
•IF f(N)>B, RETURN f(N)
•IF N is a goal, EXIT algorithm
•IF N has no children, RETURN infinity
•FOR each child Ni of N, F[i] := f(Ni)
•sort Ni and F[i] in increasing order of F[i]
•IF only one child, F[2] := infinity
•WHILE (F[1] <= B and F[1] < infinity)
–F[1] := SRBFS(N1, MIN(B, F[2]))
–Insert N1 and F[1] in sorted order
•RETURN F[1]