Skip to content

Commit ab27ca1

Browse files
norvignorvig
authored
Update README.md
1 parent feb8b78 commit ab27ca1

File tree

1 file changed

+85
-80
lines changed

1 file changed

+85
-80
lines changed

‎README.md‎

Lines changed: 85 additions & 80 deletions
Original file line numberDiff line numberDiff line change
@@ -1,88 +1,93 @@
11
# Pseudocode
22
Pseudocode descriptions of the algorithms from [Russell](http://www.cs.berkeley.edu/~russell/) and [Norvig's](http://www.norvig.com/) [Artificial Intelligence - A Modern Approach](http://aima.cs.berkeley.edu/).
33

4-
The algorithms as they appear in the book (3rd and 4th editions) are given here:
5-
- [aima3e-algorithms.pdf](https://github.com/aimacode/pseudocode/blob/master/aima3e-algorithms.pdf)
6-
- [aima4e-algorithms.pdf](https://github.com/aimacode/pseudocode/blob/master/aima4e-algorithms.pdf)
4+
The algorithms as they appear in the book are available in pdf format:
5+
- [algorithms.pdf](https://github.com/aimacode/pseudocode/blob/master/aima4e-algorithms.pdf)
76

8-
The files listed below give the same algorithms, but in markdown format. **We need help checking that the 4th edition versions are correct (we know they are wrong for the search chapters).** When there are differences between the third edition and fourth edition pseudocode, both versions will be shown in the files listed below. (_Note:_ when editing pseudocode in a `md/*.md` file, put **two spaces at the end of a line**; this keeps the line separate from the following line.)
7+
The files listed below give the same algorithms, but in markdown format. **We need help checking that the 4th edition versions are correct.** We are in the process of updating from the old [3rd edition](https://github.com/aimacode/pseudocode/blob/master/aima3e-algorithms.pdf) algorithms. (_Note:_ when editing pseudocode in a `md/*.md` file, put **two spaces at the end of a line**; this keeps the line separate from the following line.)
98

109

1110
| AIMA3e | AIMA4e | Pseudo-code (in book)|
1211
|:------:|:------:|:---------------------|
13-
| 2.3 | | [TABLE-DRIVEN-AGENT](md/Table-Driven-Agent.md) |
14-
| 2.4 | | [REFLEX-VACUUM-AGENT](md/Reflex-Vacuum-Agent.md) |
15-
| 2.6 | | [SIMPLE-REFLEX-AGENT](md/Simple-Reflex-Agent.md) |
16-
| 2.8 | | [MODEL-BASED-REFLEX-AGENT](md/Model-Based-Reflex-Agent.md) |
17-
| 3.1 | | [SIMPLE-PROBLEM-SOLVING-AGENT](md/Simple-Problem-Solving-Agent.md) |
18-
| 3.7 | | [GRAPH-SEARCH](md/Tree-Search-and-Graph-Search.md) |
19-
| 3.11 | | [BREADTH-FIRST-SEARCH](md/Breadth-First-Search.md) |
20-
| 3.13 | | [UNIFORM-COST-SEARCH](md/Uniform-Cost-Search.md) |
21-
| 3.16 | | [DEPTH-LIMITED-SEARCH](md/Depth-Limited-Search.md) |
22-
| 3.17 | | [ITERATIVE-DEEPENING-SEARCH](md/Iterative-Deepening-Search.md) |
23-
| 3.24 | | [RECURSIVE-BEST-FIRST-SEARCH](md/Recursive-Best-First-Search.md) |
24-
| 4.2 | | [HILL-CLIMBING](md/Hill-Climbing.md) |
25-
| 4.5 | | [SIMULATED-ANNEALING](md/Simulated-Annealing.md) |
26-
| 4.8 | | [GENETIC-ALGORITHM](md/Genetic-Algorithm.md) |
27-
| 4.11 | | [AND-OR-GRAPH-SEARCH](md/And-Or-Graph-Search.md) |
28-
| 4.21 | | [ONLINE-DFS-AGENT](md/Online-DFS-Agent.md) |
29-
| 4.24 | | [LRTA*-AGENT](md/LRTAStar-Agent.md) |
30-
| 5.3 | | [MINIMAX-DECISION](md/Minimax-Decision.md) |
31-
| 5.7 | | [ALPHA-BETA-SEARCH](md/Alpha-Beta-Search.md) |
32-
| 6.3 | | [AC-3](md/AC-3.md) |
33-
| 6.5 | | [BACKTRACKING-SEARCH](md/Backtracking-Search.md) |
34-
| 6.8 | | [MIN-CONFLICTS](md/Min-Conflicts.md) |
35-
| 6.11 | | [TREE-CSP-SOLVER](md/Tree-CSP-Solver.md) |
36-
| 7.1| | [KB-AGENT](md/KB-Agent.md) |
37-
| 7.8 | | [TT-ENTAILS](md/TT-Entails.md) |
38-
| 7.9 | | [PL-RESOLUTION](md/PL-Resolution.md) |
39-
| 7.12 | | [PL-FC-ENTAILS?](md/PL-FC-Entails.md) |
40-
| 7.14 | | [DPLL-SATISFIABLE?](md/DPLL-Satisfiable.md) |
41-
| 7.15 | | [WALKSAT](md/WalkSAT.md) |
42-
| 7.17 | | [HYBRID-WUMPUS-AGENT](md/Hybrid-Wumpus-Agent.md) |
43-
| 7.19 | | [SATPLAN](md/SATPlan.md) |
44-
| 9.1 | | [UNIFY](md/Unify.md) |
45-
| 9.3 | | [FOL-FC-ASK](md/FOL-FC-Ask.md) |
46-
| 9.6 | | [FOL-BC-ASK](md/FOL-BC-Ask.md) |
47-
| 9.8 | | [APPEND](md/Append.md) |
48-
| 10.1 | | [AIR-CARGO-TRANSPORT-PROBLEM](md/Air-Cargo-Transport-Problem.md) |
49-
| 10.2 | | [SPARE-TIRE-PROBLEM](md/Spare-Tire-Problem.md) |
50-
| 10.3 | | [BLOCKS-WORLD](md/Blocks-World.md) |
51-
| 10.7 | | [HAVE-CAKE-AND-EAT-CAKE-TOO-PROBLEM](md/Have-Cake-And-Eat-Cake-Too.md) |
52-
| 10.9 | | [GRAPHPLAN](md/GraphPlan.md) |
53-
| 11.1 | | [JOB-SHOP-SCHEDULING-PROBLEM](md/Job-Shop-Scheduling-Problem.md)
54-
| 11.4 | | [REFINEMENT-HIGH-LEVEL-ACTIONS](md/Refinement-High-Level-Actions.md)
55-
| 11.5 | | [HIERARCHICAL-SEARCH](md/Hierarchical-Search.md) |
56-
| 11.8 | | [ANGELIC-SEARCH](md/Angelic-Search.md) |
57-
| 11.10 | | [DOUBLES-TENNIS-PROBLEM](md/Doubles-Tennis-Problem.md) |
58-
| 13.1 | | [DT-AGENT](md/DT-Agent.md) |
59-
| 14.9 | | [ENUMERATION-ASK](md/Enumeration-Ask.md) |
60-
| 14.10 | | [ELIMINATION-ASK](md/Elimination-Ask.md) |
61-
| 14.12 | | [PRIOR-SAMPLE](md/Prior-Sample.md) |
62-
| 14.13 | | [REJECTION-SAMPLING](md/Rejection-Sampling.md) |
63-
| 14.14 | | [LIKELIHOOD-WEIGHTING](md/Likelihood-Weighting.md) |
64-
| 14.15 | | [GIBBS-ASK](md/Gibbs-Ask.md) |
65-
| 15.4 | | [FORWARD-BACKWARD](md/Forward-Backward.md) |
66-
| 15.6 | | [FIXED-LAG-SMOOTHING](md/Fixed-Lag-Smoothing.md) |
67-
| 15.17 | | [PARTICLE-FILTERING](md/Particle-Filtering.md) |
68-
| 16.9 | | [INFORMATION-GATHERING-AGENT](md/Information-Gathering-Agent.md) |
69-
| 17.4 | | [VALUE-ITERATION](md/Value-Iteration.md) |
70-
| 17.7 | | [POLICY-ITERATION](md/Policy-Iteration.md) |
71-
| 17.9 | | [POMDP-VALUE-ITERATION](md/POMDP-Value-Iteration.md) |
72-
| 18.4 | | [DECISION-TREE-LEARNING](md/Decision-Tree-Learning.md) |
73-
| 18.7 | | [CROSS-VALIDATION-WRAPPER](md/Cross-Validation-Wrapper.md) |
74-
| 18.10 | | [DECISION-LIST-LEARNING](md/Decision-List-Learning.md) |
75-
| 18.23 | | [BACK-PROP-LEARNING](md/Back-Prop-Learning.md) |
76-
| 18.33 | | [ADABOOST](md/AdaBoost.md) |
77-
| 19.2 | | [CURRENT-BEST-LEARNING](md/Current-Best-Learning.md) |
78-
| 19.3 | | [VERSION-SPACE-LEARNING](md/Version-Space-Learning.md) |
79-
| 19.8 | | [MINIMAL-CONSISTENT-DET](md/Minimal-Consistent-Det.md) |
80-
| 19.12 | | [FOIL](md/Foil.md) |
81-
| 21.2 | | [PASSIVE-ADP-AGENT](md/Passive-ADP-Agent.md) |
82-
| 21.4 | | [PASSIVE-TD-AGENT](md/Passive-TD-Agent.md) |
83-
| 21.8 | | [Q-LEARNING-AGENT](md/Q-Learning-Agent.md) |
84-
| 22.1 | | [HITS](md/Hits.md) |
85-
| 23.4 | | [CYK-PARSE](md/CYK-Parse.md) |
86-
| 23.5 | | [SENTENCE-TREE](md/Sentence-Tree.md) |
87-
| 25.9 | | [MONTE-CARLO-LOCALIZATION](md/Monte-Carlo-Localization.md) |
88-
| 29.1 | | [POWERS-OF-2](md/Powers-Of-2.md) |
12+
| 2.3 | 2.7 | [TABLE-DRIVEN-AGENT](md/Table-Driven-Agent.md) |
13+
| 2.4 | 2.8 | [REFLEX-VACUUM-AGENT](md/Reflex-Vacuum-Agent.md) |
14+
| 2.6 | 2.10 | [SIMPLE-REFLEX-AGENT](md/Simple-Reflex-Agent.md) |
15+
| 2.8 | 2.12 | [MODEL-BASED-REFLEX-AGENT](md/Model-Based-Reflex-Agent.md) |
16+
| 3.1 | x | [SIMPLE-PROBLEM-SOLVING-AGENT](md/Simple-Problem-Solving-Agent.md) |
17+
| 3.7 | 3.7 | [BEST-FIRST-SEARCH](md/Tree-Search-and-Graph-Search.md) |
18+
| 3.11 |3.9 | [BREADTH-FIRST-SEARCH](md/Breadth-First-Search.md) |
19+
| 3.17 | 3.12 | [ITERATIVE-DEEPENING-SEARCH](md/Iterative-Deepening-Search.md) |
20+
| x | 3.14 | [BIBF-SEARCH]() (Bididerctional Best-First) |
21+
| 3.13 | x| [UNIFORM-COST-SEARCH](md/Uniform-Cost-Search.md) |
22+
| 3.16 | x| [DEPTH-LIMITED-SEARCH](md/Depth-Limited-Search.md) |
23+
| 3.24 | 3.22 | [RECURSIVE-BEST-FIRST-SEARCH](md/Recursive-Best-First-Search.md) |
24+
| 4.2 | 4.2 | [HILL-CLIMBING](md/Hill-Climbing.md) |
25+
| 4.5 | 4.4 | [SIMULATED-ANNEALING](md/Simulated-Annealing.md) |
26+
| 4.8 | 4.7 | [GENETIC-ALGORITHM](md/Genetic-Algorithm.md) |
27+
| 4.11 |4.10 | [AND-OR-GRAPH-SEARCH](md/And-Or-Graph-Search.md) |
28+
| 4.21 |4.20 | [ONLINE-DFS-AGENT](md/Online-DFS-Agent.md) |
29+
| 4.24 | 4.23 | [LRTA*-AGENT](md/LRTAStar-Agent.md) |
30+
| 5.3 | 5.3 | [MINIMAX-SEARCH](md/Minimax-Decision.md) (was MINIMAX-DECISION in 3e) |
31+
| 5.7 | 5.7 | [ALPHA-BETA-SEARCH](md/Alpha-Beta-Search.md) |
32+
| x | 5.11 | [MONTE-CARLO-TREE-SEARCH](md/Monte-Carlo-Tree-Search.md)
33+
| 6.3 | 6.3 | [AC-3](md/AC-3.md) |
34+
| 6.5 | 6.5 | [BACKTRACKING-SEARCH](md/Backtracking-Search.md) |
35+
| 6.8 | 6.9 | [MIN-CONFLICTS](md/Min-Conflicts.md) |
36+
| 6.11 | 6.11 | [TREE-CSP-SOLVER](md/Tree-CSP-Solver.md) |
37+
| 7.1| 7.1 | [KB-AGENT](md/KB-Agent.md) |
38+
| 7.8 | 7.10 | [TT-ENTAILS](md/TT-Entails.md) |
39+
| 7.9 | 7.13 | [PL-RESOLUTION](md/PL-Resolution.md) |
40+
| 7.12 |7.15 | [PL-FC-ENTAILS?](md/PL-FC-Entails.md) |
41+
| 7.14 | 7.17 | [DPLL-SATISFIABLE?](md/DPLL-Satisfiable.md) |
42+
| 7.15 | 7.18 | [WALKSAT](md/WalkSAT.md) |
43+
| 7.17 | 7.20 | [HYBRID-WUMPUS-AGENT](md/Hybrid-Wumpus-Agent.md) |
44+
| 7.19 | 7.22 | [SATPLAN](md/SATPlan.md) |
45+
| 9.1 | 9.1 | [UNIFY](md/Unify.md) |
46+
| 9.3 | 9.3 | [FOL-FC-ASK](md/FOL-FC-Ask.md) |
47+
| 9.6 | 9.6 | [FOL-BC-ASK](md/FOL-BC-Ask.md) |
48+
| 9.8 | 9.8 | [APPEND](md/Append.md) |
49+
| 10.1 |11.1 | [AIR-CARGO-TRANSPORT-PROBLEM](md/Air-Cargo-Transport-Problem.md) |
50+
| 10.2 |11.2 | [SPARE-TIRE-PROBLEM](md/Spare-Tire-Problem.md) |
51+
| 10.3 |11.4 | [BLOCKS-WORLD](md/Blocks-World.md) |
52+
| 10.7 |x | [HAVE-CAKE-AND-EAT-CAKE-TOO-PROBLEM](md/Have-Cake-And-Eat-Cake-Too.md) |
53+
| 10.9 | x | [GRAPHPLAN](md/GraphPlan.md) |
54+
| 11.4 |11.7 | [REFINEMENT-HIGH-LEVEL-ACTIONS](md/Refinement-High-Level-Actions.md)
55+
| 11.5 | 11.8 | [HIERARCHICAL-SEARCH](md/Hierarchical-Search.md) |
56+
| 11.8 |11.11 | [ANGELIC-SEARCH](md/Angelic-Search.md) |
57+
| 11.1 |11.13 | [JOB-SHOP-SCHEDULING-PROBLEM](md/Job-Shop-Scheduling-Problem.md)
58+
| 13.1 | 12.1 | [DT-AGENT](md/DT-Agent.md) |
59+
| 14.9 |13.11 | [ENUMERATION-ASK](md/Enumeration-Ask.md) |
60+
| 14.10 | 13.13 | [ELIMINATION-ASK](md/Elimination-Ask.md) |
61+
| 14.12 |13.16 | [PRIOR-SAMPLE](md/Prior-Sample.md) |
62+
| 14.13 13.17| | [REJECTION-SAMPLING](md/Rejection-Sampling.md) |
63+
| 14.14 |13.18 | [LIKELIHOOD-WEIGHTING](md/Likelihood-Weighting.md) |
64+
| 14.15 | 13.20 | [GIBBS-ASK](md/Gibbs-Ask.md) |
65+
| 15.4 | 14.4 | [FORWARD-BACKWARD](md/Forward-Backward.md) |
66+
| 15.6 | 14.6 | [FIXED-LAG-SMOOTHING](md/Fixed-Lag-Smoothing.md) |
67+
| 15.17 | 14.17 | [PARTICLE-FILTERING](md/Particle-Filtering.md) |
68+
| x |15.5 | [OUPM](md/oupm.md) (for citation extraction) |
69+
| x | 15.6 | [NET-VISA](md/net-visa.md) |
70+
| x | 15.9 | [RADAR](md/radar.md) (OUPM for radar tracking)|
71+
| x | 15.11| [GENERATE-IMAGE(md/generate-image.md)|
72+
| x |15.15| [GENERATE-MARKOV-LETTERS](md/generate-markov-letters.md)|
73+
| 16.9 | 16.9 | [INFORMATION-GATHERING-AGENT](md/Information-Gathering-Agent.md) |
74+
| 17.4 | 17.6 | [VALUE-ITERATION](md/Value-Iteration.md) |
75+
| 17.7 | 17.9 | [POLICY-ITERATION](md/Policy-Iteration.md) |
76+
| 17.9 |17.16 | [POMDP-VALUE-ITERATION](md/POMDP-Value-Iteration.md) |
77+
| 11.10 | 18.1| [DOUBLES-TENNIS-PROBLEM](md/Doubles-Tennis-Problem.md) |
78+
| 18.4 | 19.5 | [LEARN-DECISION-TREE](md/Decision-Tree-Learning.md) |
79+
| 18.7 | 19.8 | [CROSS-VALIDATION-WRAPPER](md/Cross-Validation-Wrapper.md) |
80+
| 18.10 | 19.11 | [DECISION-LIST-LEARNING](md/Decision-List-Learning.md) |
81+
| 18.33 | 19.25 | [ADABOOST](md/AdaBoost.md) |
82+
| 19.2 | x| [CURRENT-BEST-LEARNING](md/Current-Best-Learning.md) |
83+
| 19.3 | x| [VERSION-SPACE-LEARNING](md/Version-Space-Learning.md) |
84+
| 19.8 | x| [MINIMAL-CONSISTENT-DET](md/Minimal-Consistent-Det.md) |
85+
| 19.12 | x | [FOIL](md/Foil.md) |
86+
| 21.2 | 22.2 | [PASSIVE-ADP-AGENT](md/Passive-ADP-Agent.md) |
87+
| 21.4 | 22.4 | [PASSIVE-TD-AGENT](md/Passive-TD-Agent.md) |
88+
| 21.8 | 22.8 | [Q-LEARNING-AGENT](md/Q-Learning-Agent.md) |
89+
| 22.1 | x | [HITS](md/Hits.md) |
90+
| 23.4 |23.5 | [CYK-PARSE](md/CYK-Parse.md) |
91+
| 23.5 | 23.8| [SENTENCE-TREE](md/Sentence-Tree.md) |
92+
| 25.9 | 26.6 | [MONTE-CARLO-LOCALIZATION](md/Monte-Carlo-Localization.md) |
93+
| 29.1 | x | [POWERS-OF-2](md/Powers-Of-2.md) |

0 commit comments

Comments
 (0)