Date Added: Apr 2013
RBFS is a best-first search that runs in space that is linear with respect to the maximum search depth, regardless of the cost function used. This algorithm allows the use of all available memory. One major flaw of this algorithm is that it can visit the same node several times. This makes the computational cost may be unaffordable for some accuracy. This problem can be much solved by using various extension of heuristic search. By using anytime approach in the authors' simple RBFS will improve solution by saving the current solution & continues the search.