Uninformed search strategies

Author: samagra14

md/Depth-Limited-Search.md

@@ -1,5 +1,28 @@
 # DEPTH-LIMITED-SEARCH
 
+## AIMA4e  
+
+__function__ DEPTH-LIMITED-SEARCH(_problem_, _l_) __returns__ a solution, or failure, or cutoff  
+ _frontier_ ← a FIFO queue initially containing one path, for the _problem_'s initial state  
+ _solution_ ← failure  
+ __while__  _frontier_ is not empty __do__  
+   _parent_ ← pop(_frontier_)  
+   __if__ depth(_parent_) > l __then__  
+     _solution_ ← cutoff  
+     __else__  
+       __for__ _child_ __in__ successors(_parent_) __do__  
+         __if__ _child_ is a goal __then__  
+           __return__ _child_  
+         add _child_ to __frontier__  
+ __return__  _solution_  
+
+---
+__Figure 3.14__ An implementation of depth-limited tree search. The algorithm has two dif-
+ferent ways to signal failure to find a solution: it returns failure when it has exhausted all
+paths and proved there is no solution at any depth, and returns cutoff to mean there might be
+a solution at a deeper depth than l. Note that this algorithm does not keep track of reached
+states, and thus might visit the same state multiple times on different paths.
+
 ## AIMA3e
 __function__ DEPTH-LIMITED-SEARCH(_problem_,_limit_) __returns__ a solution, or failure/cutoff  
  __return__ RECURSIVE\-DLS(MAKE\-NODE(_problem_.INITIAL\-STATE),_problem_,_limit_)  

md/Iterative-Deepening-Search.md

@@ -1,6 +1,6 @@
 # ITERATIVE-DEEPENING-SEARCH
 
-## AIMA3e
+## AIMA3e / AIMA4e
 __function__ ITERATIVE-DEEPENING-SEARCH(_problem_) __returns__ a solution, or failure  
  __for__ _depth_ = 0 to ∞ __do__  
    _result_ ← DEPTH\-LIMITED\-SEARCH(_problem_,_depth_)