Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 406bef8

Browse files
SnShineSnShine
committed
added all the pseudo codes in 3rd edition to index in readme.md
1 parent bbf6ece commit 406bef8

File tree

1 file changed

+43
-38
lines changed

1 file changed

+43
-38
lines changed

‎README.md‎

Lines changed: 43 additions & 38 deletions
Original file line numberDiff line numberDiff line change
@@ -31,90 +31,95 @@ Here is a table of algorithms, the figure and page where they appear in the book
3131
| 2.8 | Reflex-Vacuum-Agent | `ReflexVacuumAgent` | [`agents.py`](../master/agents.py) |
3232
| 2.10 | Simple-Reflex-Agent | `SimpleReflexAgent` | [`agents.py`](../master/agents.py) |
3333
| 2.12 | Model-Based-Reflex-Agent | `ReflexAgentWithState` | [`agents.py`](../master/agents.py) |
34-
| 3.1 | Simple-Problem-Solving-Agent | `SimpleProblemSolvingAgent` | [`search.py`](../master/search.py) |
3534
| 3 | Problem | `Problem` | [`search.py`](../master/search.py) |
36-
| 3.2 | Romania | `romania` | [`search.py`](../master/search.py) |
3735
| 3 | Node | `Node` | [`search.py`](../master/search.py) |
3836
| 3 | Queue | `Queue` | [`utils.py`](../master/utils.py) |
37+
| 3.1 | Simple-Problem-Solving-Agent | `SimpleProblemSolvingAgent` | [`search.py`](../master/search.py) |
38+
| 3.2 | Romania | `romania` | [`search.py`](../master/search.py) |
3939
| 3.7 | Tree-Search | `tree_search` | [`search.py`](../master/search.py) |
4040
| 3.7 | Graph-Search | `graph_search` | [`search.py`](../master/search.py) |
4141
| 3.11 | Breadth-First-Search | `breadth_first_search` | [`search.py`](../master/search.py) |
4242
| 3.14 | Uniform-Cost-Search | `uniform_cost_search` | [`search.py`](../master/search.py) |
4343
| 3.17 | Depth-Limited-Search | `depth_limited_search` | [`search.py`](../master/search.py) |
4444
| 3.18 | Iterative-Deepening-Search | `iterative_deepening_search` | [`search.py`](../master/search.py) |
45-
| 3.19 | Graph-Search | `graph_search` | [`search.py`](../master/search.py) |
46-
| 4 | Best-First-Search | `best_first_graph_search` | [`search.py`](../master/search.py) |
47-
| 4 | A\*-Search | `astar_search` | [`search.py`](../master/search.py) |
45+
| 3.22 | Best-First-Search | `best_first_graph_search` | [`search.py`](../master/search.py) |
46+
| 3.24 | A\*-Search | `astar_search` | [`search.py`](../master/search.py) |
4847
| 3.26 | Recursive-Best-First-Search | `recursive_best_first_search` | [`search.py`](../master/search.py) |
4948
| 4.2 | Hill-Climbing | `hill_climbing` | [`search.py`](../master/search.py) |
5049
| 4.5 | Simulated-Annealing | `simulated_annealing` | [`search.py`](../master/search.py) |
5150
| 4.8 | Genetic-Algorithm | `genetic_algorithm` | [`search.py`](../master/search.py) |
51+
| 4.11 | And-Or-Graph-Search | `and_or_graph_search` | [`search.py`](../master/search.py) |
5252
| 4.21 | Online-DFS-Agent | `online_dfs_agent` | [`search.py`](../master/search.py) |
53-
| 4.24 | LRTA\*-Agent | `lrta_star_agent` | [`search.py`](../master/search.py) |
54-
| 5 | CSP | `CSP` | [`csp.py`](../master/csp.py) |
53+
| 4.24 | LRTA\*-Agent | `lrta_star_agent` | [`search.py`](../master/search.py) |
5554
| 5.3 | Minimax-Decision | `minimax_decision` | [`games.py`](../master/games.py) |
5655
| 5.7 | Alpha-Beta-Search | `alphabeta_search` | [`games.py`](../master/games.py) |
56+
| 6 | CSP | `CSP` | [`csp.py`](../master/csp.py) |
57+
| 6.3 | AC-3 | `AC3` | [`csp.py`](../master/csp.py) |
58+
| 6.5 | Backtracking-Search | `backtracking_search` | [`csp.py`](../master/csp.py) |
59+
| 6.8 | Min-Conflicts | `min_conflicts` | [`csp.py`](../master/csp.py) |
60+
| 6.11 | Tree-CSP-Solver | `tree_csp_solver` | [`csp.py`](../master/csp.py) |
5761
| 7 | KB | `KB` | [`logic.py`](../master/logic.py) |
58-
| 6.1 | KB-Agent | `KB_Agent` | [`logic.py`](../master/logic.py) |
59-
| 6.7 | Propositional Logic Sentence | `Expr` | [`logic.py`](../master/logic.py) |
60-
| 6.10 | TT-Entails | `tt_entials` | [`logic.py`](../master/logic.py) |
61-
| 7 | Convert to CNF | `to_cnf` | [`logic.py`](../master/logic.py) |
62-
| 6.12 | PL-Resolution | `pl_resolution` | [`logic.py`](../master/logic.py) |
63-
| 6.15 | PL-FC-Entails? | `pl_fc_resolution` | [`logic.py`](../master/logic.py) |
64-
| 6.17 | DPLL-Satisfiable? | `dpll_satisfiable` | [`logic.py`](../master/logic.py) |
65-
| 6.18 | WalkSAT | `WalkSAT` | [`logic.py`](../master/logic.py) |
66-
| 6.20 | Hybrid-Wumpus-Agent | `HybridWumpusAgent` | [`logic.py`](../master/logic.py) |
67-
| 6.22 | SATPlan | |
68-
| 7.3 | AC-3 | `AC3` | [`csp.py`](../master/csp.py) |
69-
| 7.5 | Backtracking-Search | `backtracking_search` | [`csp.py`](../master/csp.py) |
70-
| 7.8 | Min-Conflicts | `min_conflicts` | [`csp.py`](../master/csp.py) |
62+
| 7.1 | KB-Agent | `KB_Agent` | [`logic.py`](../master/logic.py) |
63+
| 7.7 | Propositional Logic Sentence | `Expr` | [`logic.py`](../master/logic.py) |
64+
| 7.10 | TT-Entails | `tt_entials` | [`logic.py`](../master/logic.py) |
65+
| 7.12 | PL-Resolution | `pl_resolution` | [`logic.py`](../master/logic.py) |
66+
| 7.14 | Convert to CNF | `to_cnf` | [`logic.py`](../master/logic.py) |
67+
| 7.15 | PL-FC-Entails? | `pl_fc_resolution` | [`logic.py`](../master/logic.py) |
68+
| 7.17 | DPLL-Satisfiable? | `dpll_satisfiable` | [`logic.py`](../master/logic.py) |
69+
| 7.18 | WalkSAT | `WalkSAT` | [`logic.py`](../master/logic.py) |
70+
| 7.20 | Hybrid-Wumpus-Agent | `HybridWumpusAgent` | [`logic.py`](../master/logic.py) |
71+
| 7.22 | SATPlan | |
7172
| 9 | Subst | `subst` | [`logic.py`](../master/logic.py) |
7273
| 9.1 | Unify | `unify` | [`logic.py`](../master/logic.py) |
7374
| 9.3 | FOL-FC-Ask | `fol_fc_ask` | [`logic.py`](../master/logic.py) |
7475
| 9.6 | FOL-BC-Ask | `fol_bc_ask` | [`logic.py`](../master/logic.py) |
75-
| 9.14 | Otter | |
76+
| 9.8 | Append | | |
7677
| 10.1 | Air-Cargo-problem | |
7778
| 10.2 | Spare-Tire-Problem | |
7879
| 10.3 | Three-Block-Tower | |
79-
| 11 | Partial-Order-Planner | |
8080
| 10.7 | Cake-Problem | |
8181
| 10.9 | Graphplan | |
82-
| 12.1 | Job-Shop-Problem | |
82+
| 10.13 | Partial-Order-Planner | |
8383
| 11.1 | Job-Shop-Problem-With-Resources | |
84-
| 12.6 | House-Building-Problem | |
85-
| 12.10 | And-Or-Graph-Search | `and_or_graph_search` | [`search.py`](../master/search.py) |
86-
| 12.22 | Continuous-POP-Agent | |
87-
| 12.23 | Doubles-tennis | |
88-
| 13.1 | DT-Agent | `DTAgent` | [`probability.py`](../master/probability.py) |
84+
| 11.5 | Hierarchical-Search | |
85+
| 11.8 | Angelic-Search | |
86+
| \*12.6 | House-Building-Problem | |
87+
| \*12.22 | Continuous-POP-Agent | |
88+
| 11.10 | Doubles-tennis | |
8989
| 13 | Discrete Probability Distribution | `DiscreteProbDist` | [`probability.py`](../master/probability.py) |
90-
| 13.4 | Enumerate-Joint-Ask | `enumerate_joint_ask` | [`probability.py`](../master/probability.py) |
90+
| 13.1 | DT-Agent | `DTAgent` | [`probability.py`](../master/probability.py) |
91+
| \*13.4 | Enumerate-Joint-Ask | `enumerate_joint_ask` | [`probability.py`](../master/probability.py) |
92+
| 14.9 | Enumeration-Ask | `enumeration_ask` | [`probability.py`](../master/probability.py) |
9193
| 14.11 | Elimination-Ask | `elimination_ask` | [`probability.py`](../master/probability.py) |
9294
| 14.13 | Prior-Sample | `prior_sample` | [`probability.py`](../master/probability.py) |
9395
| 14.14 | Rejection-Sampling | `rejection_sampling` | [`probability.py`](../master/probability.py) |
9496
| 14.15 | Likelihood-Weighting | `likelihood_weighting` | [`probability.py`](../master/probability.py) |
95-
| 14.15 | MCMC-Ask | |
97+
| 14.16 | Gibbs-Ask | |
9698
| 15.4 | Forward-Backward | `forward_backward` | [`probability.py`](../master/probability.py) |
9799
| 15.6 | Fixed-Lag-Smoothing | `fixed_lag_smoothing` | [`probability.py`](../master/probability.py) |
98100
| 15.17 | Particle-Filtering | `particle_filtering` | [`probability.py`](../master/probability.py) |
99101
| 16.9 | Information-Gathering-Agent | |
100102
| 17.4 | Value-Iteration | `value_iteration` | [`mdp.py`](../master/mdp.py) |
101103
| 17.7 | Policy-Iteration | `policy_iteration` | [`mdp.py`](../master/mdp.py) |
104+
| 17.7 | POMDP-Value-Iteration | | |
102105
| 18.5 | Decision-Tree-Learning | `DecisionTreeLearner` | [`learning.py`](../master/learning.py) |
106+
| 18.8 | Cross-Validation | `cross_validation` | [`learning.py`](../master/learning.py) |
103107
| 18.11 | Decision-List-Learning | |
104108
| 18.24 | Back-Prop-Learning | |
105109
| 18.34 | AdaBoost | `AdaBoost` | [`learning.py`](../master/learning.py) |
106110
| 19.2 | Current-Best-Learning | |
107111
| 19.3 | Version-Space-Learning | |
108112
| 19.8 | Minimal-Consistent-Det | |
109113
| 19.12 | FOIL | |
110-
| 20.21 | Perceptron-Learning | `PerceptronLearner` | [`learning.py`](../master/learning.py) |
111-
| 22.2 | Passive-ADP-Agent | `PassiveADPAgent` | [`rl.py`](../master/rl.py) |
112-
| 22.4 | Passive-TD-Agent | `PassiveTDAgent` | [`rl.py`](../master/rl.py) |
113-
| 22.8 | Q-Learning-Agent | |
114-
| 22.2 | Naive-Communicating-Agent | |
115-
| 22.7 | Chart-Parse | `Chart` | [`nlp.py`](../master/nlp.py) |
116-
| 23.1 | Viterbi-Segmentation | `viterbi_segment` | [`text.py`](../master/text.py) |
117-
| 24.21 | Align | |
114+
| 21.2 | Passive-ADP-Agent | `PassiveADPAgent` | [`rl.py`](../master/rl.py) |
115+
| 21.4 | Passive-TD-Agent | `PassiveTDAgent` | [`rl.py`](../master/rl.py) |
116+
| 21.8 | Q-Learning-Agent | |
117+
| \*21.2 | Naive-Communicating-Agent | |
118+
| 22.1 | HITS | | |
119+
| 23 | Chart-Parse | `Chart` | [`nlp.py`](../master/nlp.py) |
120+
| 23.5 | CYK-Parse | | |
121+
| \*23.1 | Viterbi-Segmentation | `viterbi_segment` | [`text.py`](../master/text.py) |
122+
| \*24.21 | Align | |
118123
| 25.9 | Monte-Carlo-Localization| |
119124

120125

0 commit comments

Comments
 (0)