From 864972ce9b70e5fc6a466b5401bed1bef4cc4257 Mon Sep 17 00:00:00 2001 From: Sudhanshu Bhoi <34285367+SudhanshuBhoi@users.noreply.github.com> Date: Tue, 26 Mar 2019 22:16:37 +0530 Subject: [PATCH] Correct Recursive-Best-First-Search.md Corrected Recursive-Best-First-Search.md according to aima4e-algorithms.pdf. --- md/Recursive-Best-First-Search.md | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) diff --git a/md/Recursive-Best-First-Search.md b/md/Recursive-Best-First-Search.md index b4166f2..9dc4a72 100644 --- a/md/Recursive-Best-First-Search.md +++ b/md/Recursive-Best-First-Search.md @@ -1,5 +1,26 @@ # RECURSIVE-BEST-FIRST-SEARCH +## AIMA4e +__function__ RECURSIVE-BEST-FIRST-SEARCH(_problem_) __returns__ a solution, or failure + __return__ RBFS(_problem_,MAKE\-NODE(_problem_.INITIAL\-STATE),∞) + +__function__ RBFS(_problem_,_node_,_f\_limit_) __returns__ a solution, or failure and a new _f_\-cost limit + __if__ _problem_.GOAL-TEST(_node_.STATE) __then return__ _node_ + _successors_ ← EXPAND(_node_) + __if__ _successors_ is empty __then return__ _failure_,∞ + __for__ _s_ __in__ _successors_ __do__ /\* update _f_ with value from previous search, if any \*/ +   _s.f_ ← max(_s.g_ + _s.h_, _node.f_) + __loop do__ +   _best_ ← lowest _f_\-value node in _successors_ +   __if__ _best.f_ > _f\_limit_ __then return__ _failure, best.f_ +   _alternative_ ← the second-lowest _f_\-value among _successors_ +   _result,best.f_ ← RBFS(_problem_,_best_,min(_f\_limit_,_alternative_)) +   __if__ _result_ ≠ _failure_ __then return__ _result, best.f_ + +--- +__Figure__ 3.5 The algorithm for recursive best\-first search. + + ## AIMA3e __function__ RECURSIVE-BEST-FIRST-SEARCH(_problem_) __returns__ a solution, or failure  __return__ RBFS(_problem_,MAKE\-NODE(_problem_.INITIAL\-STATE),∞)