fix document errors

peijl1998 · peijl1998 · commit a648c39989e3 · 2018-02-19T18:14:42.000+08:00
diff --git a/md/And-Or-Graph-Search.md b/md/And-Or-Graph-Search.md
@@ -22,4 +22,4 @@ __function__ AND\-SEARCH(_states_, _problem_, _path_) __returns__ _a conditional
 
 ---
 
-__Figure__ ?? An algorithm for searching AND\-OR graphs generated by nondeterministic environments. It returns a conditional plan that reaces a goal state in all circumstances. (The notations \[_x_ | _l_\] refers to the list formed by adding object _x_ to the front of list _l_).
+__Figure__ ?? An algorithm for searching AND\-OR graphs generated by nondeterministic environments. It returns a conditional plan that reaches a goal state in all circumstances. (The notations \[_x_ | _l_\] refers to the list formed by adding object _x_ to the front of list _l_).
diff --git a/md/Breadth-First-Search.md b/md/Breadth-First-Search.md
@@ -2,7 +2,7 @@
 
 ## AIMA3e
 __function__ BREADTH-FIRST-SEARCH(_problem_) __returns__ a solution, or failure  
-&emsp;_node_ &larr; a node with STATE = _problem_.INITIAL\-STATE 
+&emsp;_node_ &larr; a node with STATE = _problem_.INITIAL\-STATE, PATH\-COST = 0    
 &emsp;__if__ _problem_.GOAL\-TEST(_node_.STATE) __then return__ SOLUTION(_node_)  
 &emsp;_frontier_ &larr; a FIFO queue with _node_ as the only element  
 &emsp;_explored_ &larr; an empty set  
diff --git a/md/Depth-Limited-Search.md b/md/Depth-Limited-Search.md
@@ -2,10 +2,10 @@
 
 ## AIMA3e
 __function__ DEPTH-LIMITED-SEARCH(_problem_,_limit_) __returns__ a solution, or failure/cutoff  
-&emsp;__return__ RECURSIVE\-DLS(MAKE\-NODE(_problem_.INTIAL\-STATE),_problem_,_limit_)  
+&emsp;__return__ RECURSIVE\-DLS(MAKE\-NODE(_problem_.INITIAL\-STATE),_problem_,_limit_)  
 
 __function__ RECURSIVE\-DLS(_node_,_problem_,_limit_) __returns__ a solution, or failure/cutoff  
-&emsp;if _problem_.GOAL-TEST(_node_.STATE) __then return__ SOLUTION(_node_)  
+&emsp;__if__ _problem_.GOAL-TEST(_node_.STATE) __then return__ SOLUTION(_node_)  
 &emsp;__else if__ _limit_ = 0 __then return__ _cutoff_  
 &emsp;__else__  
 &emsp;&emsp;&emsp;_cutoff\_occurred?_ &larr; false  
diff --git a/md/Genetic-Algorithm.md b/md/Genetic-Algorithm.md
@@ -49,7 +49,7 @@ __function__ GENETIC-ALGORITHM(_population_,FITNESS\-FN) __returns__ an individu
 __function__ REPRODUCE(_x_, _y_) __returns__ an individual  
 &emsp;__inputs__: _x_,_y_, parent individuals  
 
-&emsp;_n_ &larr; LENGTH(_x_); _c_ &larr; random number from 0 to _n_  
+&emsp;_n_ &larr; LENGTH(_x_); _c_ &larr; random number from 1 to _n_  
 &emsp;__return__ APPEND(SUBSTRING(_x_, 1, _c_),SUBSTRING(_y_, _c_+1, _n_))  
 
 ---

Original file line number	Diff line number	Diff line change
`@@ -22,4 +22,4 @@ __function__ AND\-SEARCH(_states_, _problem_, _path_) __returns__ _a conditional`
`22`	`22`
`23`	`23`	`---`
`24`	`24`
`25`		`-__Figure__ ?? An algorithm for searching AND\-OR graphs generated by nondeterministic environments. It returns a conditional plan that reaces a goal state in all circumstances. (The notations \[_x_ \| _l_\] refers to the list formed by adding object _x_ to the front of list _l_).`
	`25`	`+__Figure__ ?? An algorithm for searching AND\-OR graphs generated by nondeterministic environments. It returns a conditional plan that reaches a goal state in all circumstances. (The notations \[_x_ \| _l_\] refers to the list formed by adding object _x_ to the front of list _l_).`