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

Skip to content

Commit bbf6ece

Browse files
SnShineSnShine
committed
removes page numbers in index of code, readme.md
1 parent 1239cff commit bbf6ece

File tree

1 file changed

+94
-94
lines changed

1 file changed

+94
-94
lines changed

‎README.md

Lines changed: 94 additions & 94 deletions
Original file line numberDiff line numberDiff line change
@@ -22,100 +22,100 @@ When complete, this project will have Python code for all the pseudocode algorit
2222
Here is a table of algorithms, the figure and page where they appear in the book, and the file where they appear in the code. Unfortuately, this chart was made for the old second edition; and has only been partially upfdated to third edition, and not at all to fourth edition. We could use help fixing up the table, based on the figures in [algorithms.pdf](https://github.com/aimacode/aima-pseudocode/blob/master/algorithms.pdf). Empty implementations are a good place for contributors to look for an iassue.
2323

2424

25-
| **Fig** | **Page** | **Name (in 3<sup>rd</sup> edition)** | **Name (in code)** | **File**
26-
|:--------|:---------|:-------------------|:---------|:-----------|
27-
| 2.1 | 36 | Environment | `Environment` | [`agents.py`](../master/agents.py) |
28-
| 2.1 | 36 | Agent | `Agent` | [`agents.py`](../master/agents.py) |
29-
| 2.3 | 37 | Table-Driven-Vacuum-Agent | `TableDrivenVacuumAgent` | [`agents.py`](../master/agents.py) |
30-
| 2.7 | 48 | Table-Driven-Agent | `TableDrivenAgent` | [`agents.py`](../master/agents.py) |
31-
| 2.8 | 49 | Reflex-Vacuum-Agent | `ReflexVacuumAgent` | [`agents.py`](../master/agents.py) |
32-
| 2.10 | 50 | Simple-Reflex-Agent | `SimpleReflexAgent` | [`agents.py`](../master/agents.py) |
33-
| 2.12 | 52 | Model-Based-Reflex-Agent | `ReflexAgentWithState` | [`agents.py`](../master/agents.py) |
34-
| 3.1 | 69 | Simple-Problem-Solving-Agent | `SimpleProblemSolvingAgent` | [`search.py`](../master/search.py) |
35-
| 3 | 62 | Problem | `Problem` | [`search.py`](../master/search.py) |
36-
| 3.2 | 70 | Romania | `romania` | [`search.py`](../master/search.py) |
37-
| 3 | 69 | Node | `Node` | [`search.py`](../master/search.py) |
38-
| 3 | 71 | Queue | `Queue` | [`utils.py`](../master/utils.py) |
39-
| 3.7 | 79 | Tree-Search | `tree_search` | [`search.py`](../master/search.py) |
40-
| 3.7 | 79 | Graph-Search | `graph_search` | [`search.py`](../master/search.py) |
41-
| 3.11 | 84 | Breadth-First-Search | `breadth_first_search` | [`search.py`](../master/search.py) |
42-
| 3.14 | 86 | Uniform-Cost-Search | `uniform_cost_search` | [`search.py`](../master/search.py) |
43-
| 3.17 | 90 | Depth-Limited-Search | `depth_limited_search` | [`search.py`](../master/search.py) |
44-
| 3.18 | 91 | Iterative-Deepening-Search | `iterative_deepening_search` | [`search.py`](../master/search.py) |
45-
| 3.19 | 83 | Graph-Search | `graph_search` | [`search.py`](../master/search.py) |
46-
| 4 | 95 | Best-First-Search | `best_first_graph_search` | [`search.py`](../master/search.py) |
47-
| 4 | 97 | A\*-Search | `astar_search` | [`search.py`](../master/search.py) |
48-
| 3.26 | 101 | Recursive-Best-First-Search | `recursive_best_first_search` | [`search.py`](../master/search.py) |
49-
| 4.2 | 125 | Hill-Climbing | `hill_climbing` | [`search.py`](../master/search.py) |
50-
| 4.5 | 129 | Simulated-Annealing | `simulated_annealing` | [`search.py`](../master/search.py) |
51-
| 4.8 | 132 | Genetic-Algorithm | `genetic_algorithm` | [`search.py`](../master/search.py) |
52-
| 4.21 | 153 | Online-DFS-Agent | `online_dfs_agent` | [`search.py`](../master/search.py) |
53-
| 4.24 | 155 | LRTA\*-Agent | `lrta_star_agent` | [`search.py`](../master/search.py) |
54-
| 5 | 137 | CSP | `CSP` | [`csp.py`](../master/csp.py) |
55-
| 5.3 | 169 | Minimax-Decision | `minimax_decision` | [`games.py`](../master/games.py) |
56-
| 5.7 | 173 | Alpha-Beta-Search | `alphabeta_search` | [`games.py`](../master/games.py) |
57-
| 7 | 195 | KB | `KB` | [`logic.py`](../master/logic.py) |
58-
| 6.1 | 208 | KB-Agent | `KB_Agent` | [`logic.py`](../master/logic.py) |
59-
| 6.7 | 216 | Propositional Logic Sentence | `Expr` | [`logic.py`](../master/logic.py) |
60-
| 6.10 | 220 | TT-Entails | `tt_entials` | [`logic.py`](../master/logic.py) |
61-
| 7 | 215 | Convert to CNF | `to_cnf` | [`logic.py`](../master/logic.py) |
62-
| 6.12 | 227 | PL-Resolution | `pl_resolution` | [`logic.py`](../master/logic.py) |
63-
| 6.15 | 230 | PL-FC-Entails? | `pl_fc_resolution` | [`logic.py`](../master/logic.py) |
64-
| 6.17 | 233 | DPLL-Satisfiable? | `dpll_satisfiable` | [`logic.py`](../master/logic.py) |
65-
| 6.18 | 235 | WalkSAT | `WalkSAT` | [`logic.py`](../master/logic.py) |
66-
| 6.20 | 242 | Hybrid-Wumpus-Agent | `HybridWumpusAgent` | [`logic.py`](../master/logic.py) |
67-
| 6.22 | 244 | SATPlan | |
68-
| 7.3 | 265 | AC-3 | `AC3` | [`csp.py`](../master/csp.py) |
69-
| 7.5 | 271 | Backtracking-Search | `backtracking_search` | [`csp.py`](../master/csp.py) |
70-
| 7.8 | 277 | Min-Conflicts | `min_conflicts` | [`csp.py`](../master/csp.py) |
71-
| 9 | 273 | Subst | `subst` | [`logic.py`](../master/logic.py) |
72-
| 9.1 | 334 | Unify | `unify` | [`logic.py`](../master/logic.py) |
73-
| 9.3 | 338 | FOL-FC-Ask | `fol_fc_ask` | [`logic.py`](../master/logic.py) |
74-
| 9.6 | 344 | FOL-BC-Ask | `fol_bc_ask` | [`logic.py`](../master/logic.py) |
75-
| 9.14 | 307 | Otter | |
76-
| 10.1 | 376 | Air-Cargo-problem | |
77-
| 10.2 | 377 | Spare-Tire-Problem | |
78-
| 10.3 | 378 | Three-Block-Tower | |
79-
| 11 | 390 | Partial-Order-Planner | |
80-
| 10.7 | 387 | Cake-Problem | |
81-
| 10.9 | 390 | Graphplan | |
82-
| 12.1 | 418 | Job-Shop-Problem | |
83-
| 11.1 | 409 | Job-Shop-Problem-With-Resources | |
84-
| 12.6 | 424 | House-Building-Problem | |
85-
| 12.10 | 435 | And-Or-Graph-Search | `and_or_graph_search` | [`search.py`](../master/search.py) |
86-
| 12.22 | 449 | Continuous-POP-Agent | |
87-
| 12.23 | 450 | Doubles-tennis | |
88-
| 13.1 | 492 | DT-Agent | `DTAgent` | [`probability.py`](../master/probability.py) |
89-
| 13 | 469 | Discrete Probability Distribution | `DiscreteProbDist` | [`probability.py`](../master/probability.py) |
90-
| 13.4 | 477 | Enumerate-Joint-Ask | `enumerate_joint_ask` | [`probability.py`](../master/probability.py) |
91-
| 14.11 | 537 | Elimination-Ask | `elimination_ask` | [`probability.py`](../master/probability.py) |
92-
| 14.13 | 540 | Prior-Sample | `prior_sample` | [`probability.py`](../master/probability.py) |
93-
| 14.14 | 542 | Rejection-Sampling | `rejection_sampling` | [`probability.py`](../master/probability.py) |
94-
| 14.15 | 543 | Likelihood-Weighting | `likelihood_weighting` | [`probability.py`](../master/probability.py) |
95-
| 14.15 | 517 | MCMC-Ask | |
96-
| 15.4 | 586 | Forward-Backward | `forward_backward` | [`probability.py`](../master/probability.py) |
97-
| 15.6 | 590 | Fixed-Lag-Smoothing | `fixed_lag_smoothing` | [`probability.py`](../master/probability.py) |
98-
| 15.17 | 608 | Particle-Filtering | `particle_filtering` | [`probability.py`](../master/probability.py) |
99-
| 16.9 | 643 | Information-Gathering-Agent | |
100-
| 17.4 | 664 | Value-Iteration | `value_iteration` | [`mdp.py`](../master/mdp.py) |
101-
| 17.7 | 668 | Policy-Iteration | `policy_iteration` | [`mdp.py`](../master/mdp.py) |
102-
| 18.5 | 713 | Decision-Tree-Learning | `DecisionTreeLearner` | [`learning.py`](../master/learning.py) |
103-
| 18.11 | 728 | Decision-List-Learning | |
104-
| 18.24 | 745 | Back-Prop-Learning | |
105-
| 18.34 | 762 | AdaBoost | `AdaBoost` | [`learning.py`](../master/learning.py) |
106-
| 19.2 | 783 | Current-Best-Learning | |
107-
| 19.3 | 785 | Version-Space-Learning | |
108-
| 19.8 | 798 | Minimal-Consistent-Det | |
109-
| 19.12 | 805 | FOIL | |
110-
| 20.21 | 742 | Perceptron-Learning | `PerceptronLearner` | [`learning.py`](../master/learning.py) |
111-
| 22.2 | 877 | Passive-ADP-Agent | `PassiveADPAgent` | [`rl.py`](../master/rl.py) |
112-
| 22.4 | 880 | Passive-TD-Agent | `PassiveTDAgent` | [`rl.py`](../master/rl.py) |
113-
| 22.8 | 887 | Q-Learning-Agent | |
114-
| 22.2 | 796 | Naive-Communicating-Agent | |
115-
| 22.7 | 801 | Chart-Parse | `Chart` | [`nlp.py`](../master/nlp.py) |
116-
| 23.1 | 837 | Viterbi-Segmentation | `viterbi_segment` | [`text.py`](../master/text.py) |
117-
| 24.21 | 892 | Align | |
118-
| 25.9 | 999 | Monte-Carlo-Localization| |
25+
| **Fig** | **Name (in 3<sup>rd</sup> edition)** | **Name (in code)** | **File**
26+
|:--------|:-------------------|:---------|:-----------|
27+
| 2.1 | Environment | `Environment` | [`agents.py`](../master/agents.py) |
28+
| 2.1 | Agent | `Agent` | [`agents.py`](../master/agents.py) |
29+
| 2.3 | Table-Driven-Vacuum-Agent | `TableDrivenVacuumAgent` | [`agents.py`](../master/agents.py) |
30+
| 2.7 | Table-Driven-Agent | `TableDrivenAgent` | [`agents.py`](../master/agents.py) |
31+
| 2.8 | Reflex-Vacuum-Agent | `ReflexVacuumAgent` | [`agents.py`](../master/agents.py) |
32+
| 2.10 | Simple-Reflex-Agent | `SimpleReflexAgent` | [`agents.py`](../master/agents.py) |
33+
| 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) |
35+
| 3 | Problem | `Problem` | [`search.py`](../master/search.py) |
36+
| 3.2 | Romania | `romania` | [`search.py`](../master/search.py) |
37+
| 3 | Node | `Node` | [`search.py`](../master/search.py) |
38+
| 3 | Queue | `Queue` | [`utils.py`](../master/utils.py) |
39+
| 3.7 | Tree-Search | `tree_search` | [`search.py`](../master/search.py) |
40+
| 3.7 | Graph-Search | `graph_search` | [`search.py`](../master/search.py) |
41+
| 3.11 | Breadth-First-Search | `breadth_first_search` | [`search.py`](../master/search.py) |
42+
| 3.14 | Uniform-Cost-Search | `uniform_cost_search` | [`search.py`](../master/search.py) |
43+
| 3.17 | Depth-Limited-Search | `depth_limited_search` | [`search.py`](../master/search.py) |
44+
| 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) |
48+
| 3.26 | Recursive-Best-First-Search | `recursive_best_first_search` | [`search.py`](../master/search.py) |
49+
| 4.2 | Hill-Climbing | `hill_climbing` | [`search.py`](../master/search.py) |
50+
| 4.5 | Simulated-Annealing | `simulated_annealing` | [`search.py`](../master/search.py) |
51+
| 4.8 | Genetic-Algorithm | `genetic_algorithm` | [`search.py`](../master/search.py) |
52+
| 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) |
55+
| 5.3 | Minimax-Decision | `minimax_decision` | [`games.py`](../master/games.py) |
56+
| 5.7 | Alpha-Beta-Search | `alphabeta_search` | [`games.py`](../master/games.py) |
57+
| 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) |
71+
| 9 | Subst | `subst` | [`logic.py`](../master/logic.py) |
72+
| 9.1 | Unify | `unify` | [`logic.py`](../master/logic.py) |
73+
| 9.3 | FOL-FC-Ask | `fol_fc_ask` | [`logic.py`](../master/logic.py) |
74+
| 9.6 | FOL-BC-Ask | `fol_bc_ask` | [`logic.py`](../master/logic.py) |
75+
| 9.14 | Otter | |
76+
| 10.1 | Air-Cargo-problem | |
77+
| 10.2 | Spare-Tire-Problem | |
78+
| 10.3 | Three-Block-Tower | |
79+
| 11 | Partial-Order-Planner | |
80+
| 10.7 | Cake-Problem | |
81+
| 10.9 | Graphplan | |
82+
| 12.1 | Job-Shop-Problem | |
83+
| 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) |
89+
| 13 | Discrete Probability Distribution | `DiscreteProbDist` | [`probability.py`](../master/probability.py) |
90+
| 13.4 | Enumerate-Joint-Ask | `enumerate_joint_ask` | [`probability.py`](../master/probability.py) |
91+
| 14.11 | Elimination-Ask | `elimination_ask` | [`probability.py`](../master/probability.py) |
92+
| 14.13 | Prior-Sample | `prior_sample` | [`probability.py`](../master/probability.py) |
93+
| 14.14 | Rejection-Sampling | `rejection_sampling` | [`probability.py`](../master/probability.py) |
94+
| 14.15 | Likelihood-Weighting | `likelihood_weighting` | [`probability.py`](../master/probability.py) |
95+
| 14.15 | MCMC-Ask | |
96+
| 15.4 | Forward-Backward | `forward_backward` | [`probability.py`](../master/probability.py) |
97+
| 15.6 | Fixed-Lag-Smoothing | `fixed_lag_smoothing` | [`probability.py`](../master/probability.py) |
98+
| 15.17 | Particle-Filtering | `particle_filtering` | [`probability.py`](../master/probability.py) |
99+
| 16.9 | Information-Gathering-Agent | |
100+
| 17.4 | Value-Iteration | `value_iteration` | [`mdp.py`](../master/mdp.py) |
101+
| 17.7 | Policy-Iteration | `policy_iteration` | [`mdp.py`](../master/mdp.py) |
102+
| 18.5 | Decision-Tree-Learning | `DecisionTreeLearner` | [`learning.py`](../master/learning.py) |
103+
| 18.11 | Decision-List-Learning | |
104+
| 18.24 | Back-Prop-Learning | |
105+
| 18.34 | AdaBoost | `AdaBoost` | [`learning.py`](../master/learning.py) |
106+
| 19.2 | Current-Best-Learning | |
107+
| 19.3 | Version-Space-Learning | |
108+
| 19.8 | Minimal-Consistent-Det | |
109+
| 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 | |
118+
| 25.9 | Monte-Carlo-Localization| |
119119

120120

121121
# Acknowledgements

0 commit comments

Comments
 (0)