@@ -64,14 +64,14 @@ Here is a table of algorithms, the figure, name of the algorithm in the book and
6464| 2.7 | Table-Driven-Agent | ` TableDrivenAgent ` | [ ` agents.py ` ] [ agents ] | Done | Included |
6565| 2.8 | Reflex-Vacuum-Agent | ` ReflexVacuumAgent ` | [ ` agents.py ` ] [ agents ] | Done | Included |
6666| 2.10 | Simple-Reflex-Agent | ` SimpleReflexAgent ` | [ ` agents.py ` ] [ agents ] | Done | Included |
67- | 2.12 | Model-Based-Reflex-Agent | ` ReflexAgentWithState ` | [ ` agents.py ` ] [ agents ] | | Included |
67+ | 2.12 | Model-Based-Reflex-Agent | ` ReflexAgentWithState ` | [ ` agents.py ` ] [ agents ] | Done | Included |
6868| 3 | Problem | ` Problem ` | [ ` search.py ` ] [ search ] | Done | Included |
6969| 3 | Node | ` Node ` | [ ` search.py ` ] [ search ] | Done | Included |
7070| 3 | Queue | ` Queue ` | [ ` utils.py ` ] [ utils ] | Done | No Need |
7171| 3.1 | Simple-Problem-Solving-Agent | ` SimpleProblemSolvingAgent ` | [ ` search.py ` ] [ search ] | Done | Included |
7272| 3.2 | Romania | ` romania ` | [ ` search.py ` ] [ search ] | Done | Included |
73- | 3.7 | Tree-Search | ` tree_search ` | [ ` search.py ` ] [ search ] | Done | |
74- | 3.7 | Graph-Search | ` graph_search ` | [ ` search.py ` ] [ search ] | Done | |
73+ | 3.7 | Tree-Search | ` depth/breadth_first_tree_search ` | [ ` search.py ` ] [ search ] | Done | Included |
74+ | 3.7 | Graph-Search | ` depth/breadth_first_graph_search ` | [ ` search.py ` ] [ search ] | Done | Included |
7575| 3.11 | Breadth-First-Search | ` breadth_first_graph_search ` | [ ` search.py ` ] [ search ] | Done | Included |
7676| 3.14 | Uniform-Cost-Search | ` uniform_cost_search ` | [ ` search.py ` ] [ search ] | Done | Included |
7777| 3.17 | Depth-Limited-Search | ` depth_limited_search ` | [ ` search.py ` ] [ search ] | Done | Included |
@@ -93,7 +93,7 @@ Here is a table of algorithms, the figure, name of the algorithm in the book and
9393| 6.8 | Min-Conflicts | ` min_conflicts ` | [ ` csp.py ` ] [ csp ] | Done | Included |
9494| 6.11 | Tree-CSP-Solver | ` tree_csp_solver ` | [ ` csp.py ` ] [ csp ] | Done | Included |
9595| 7 | KB | ` KB ` | [ ` logic.py ` ] [ logic ] | Done | Included |
96- | 7.1 | KB-Agent | ` KB_AgentProgram ` | [ ` logic.py ` ] [ logic ] | Done | |
96+ | 7.1 | KB-Agent | ` KB_AgentProgram ` | [ ` logic.py ` ] [ logic ] | Done | Included |
9797| 7.7 | Propositional Logic Sentence | ` Expr ` | [ ` utils.py ` ] [ utils ] | Done | Included |
9898| 7.10 | TT-Entails | ` tt_entails ` | [ ` logic.py ` ] [ logic ] | Done | Included |
9999| 7.12 | PL-Resolution | ` pl_resolution ` | [ ` logic.py ` ] [ logic ] | Done | Included |
@@ -103,7 +103,7 @@ Here is a table of algorithms, the figure, name of the algorithm in the book and
103103| 7.18 | WalkSAT | ` WalkSAT ` | [ ` logic.py ` ] [ logic ] | Done | Included |
104104| 7.20 | Hybrid-Wumpus-Agent | ` HybridWumpusAgent ` | | | |
105105| 7.22 | SATPlan | ` SAT_plan ` | [ ` logic.py ` ] [ logic ] | Done | Included |
106- | 9 | Subst | ` subst ` | [ ` logic.py ` ] [ logic ] | Done | |
106+ | 9 | Subst | ` subst ` | [ ` logic.py ` ] [ logic ] | Done | Included |
107107| 9.1 | Unify | ` unify ` | [ ` logic.py ` ] [ logic ] | Done | Included |
108108| 9.3 | FOL-FC-Ask | ` fol_fc_ask ` | [ ` logic.py ` ] [ logic ] | Done | Included |
109109| 9.6 | FOL-BC-Ask | ` fol_bc_ask ` | [ ` logic.py ` ] [ logic ] | Done | Included |
0 commit comments