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

Skip to content

Convert File Links into Reference-Style #271

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Mar 5, 2017
Merged

Convert File Links into Reference-Style #271

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1178d2b
Change Link's Style
Z-Fikar Nov 13, 2016
9b04019
Merge branch 'master' into patch-1
Z-Fikar Mar 3, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
177 changes: 96 additions & 81 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -24,58 +24,57 @@ When complete, this project will have Python code for all the pseudocode algorit

Here is a table of algorithms, the figure, name of the code in the book and in the repository, and the file where they are implemented in the code. This chart was made for the third edition of the book and needs to be updated for the upcoming fourth edition. Empty implementations are a good place for contributors to look for an issue. The [aima-pseudocode](https://github.com/aimacode/aima-pseudocode) project describes all the algorithms from the book.


| **Figure** | **Name (in 3<sup>rd</sup> edition)** | **Name (in repository)** | **File**
|:--------|:-------------------|:---------|:-----------|
| 2.1 | Environment | `Environment` | [`agents.py`](../master/agents.py) |
| 2.1 | Agent | `Agent` | [`agents.py`](../master/agents.py) |
| 2.3 | Table-Driven-Vacuum-Agent | `TableDrivenVacuumAgent` | [`agents.py`](../master/agents.py) |
| 2.7 | Table-Driven-Agent | `TableDrivenAgent` | [`agents.py`](../master/agents.py) |
| 2.8 | Reflex-Vacuum-Agent | `ReflexVacuumAgent` | [`agents.py`](../master/agents.py) |
| 2.10 | Simple-Reflex-Agent | `SimpleReflexAgent` | [`agents.py`](../master/agents.py) |
| 2.12 | Model-Based-Reflex-Agent | `ReflexAgentWithState` | [`agents.py`](../master/agents.py) |
| 3 | Problem | `Problem` | [`search.py`](../master/search.py) |
| 3 | Node | `Node` | [`search.py`](../master/search.py) |
| 3 | Queue | `Queue` | [`utils.py`](../master/utils.py) |
| 3.1 | Simple-Problem-Solving-Agent | `SimpleProblemSolvingAgent` | [`search.py`](../master/search.py) |
| 3.2 | Romania | `romania` | [`search.py`](../master/search.py) |
| 3.7 | Tree-Search | `tree_search` | [`search.py`](../master/search.py) |
| 3.7 | Graph-Search | `graph_search` | [`search.py`](../master/search.py) |
| 3.11 | Breadth-First-Search | `breadth_first_search` | [`search.py`](../master/search.py) |
| 3.14 | Uniform-Cost-Search | `uniform_cost_search` | [`search.py`](../master/search.py) |
| 3.17 | Depth-Limited-Search | `depth_limited_search` | [`search.py`](../master/search.py) |
| 3.18 | Iterative-Deepening-Search | `iterative_deepening_search` | [`search.py`](../master/search.py) |
| 3.22 | Best-First-Search | `best_first_graph_search` | [`search.py`](../master/search.py) |
| 3.24 | A\*-Search | `astar_search` | [`search.py`](../master/search.py) |
| 3.26 | Recursive-Best-First-Search | `recursive_best_first_search` | [`search.py`](../master/search.py) |
| 4.2 | Hill-Climbing | `hill_climbing` | [`search.py`](../master/search.py) |
| 4.5 | Simulated-Annealing | `simulated_annealing` | [`search.py`](../master/search.py) |
| 4.8 | Genetic-Algorithm | `genetic_algorithm` | [`search.py`](../master/search.py) |
| 4.11 | And-Or-Graph-Search | `and_or_graph_search` | [`search.py`](../master/search.py) |
| 4.21 | Online-DFS-Agent | `online_dfs_agent` | [`search.py`](../master/search.py) |
| 4.24 | LRTA\*-Agent | `LRTAStarAgent` | [`search.py`](../master/search.py) |
| 5.3 | Minimax-Decision | `minimax_decision` | [`games.py`](../master/games.py) |
| 5.7 | Alpha-Beta-Search | `alphabeta_search` | [`games.py`](../master/games.py) |
| 6 | CSP | `CSP` | [`csp.py`](../master/csp.py) |
| 6.3 | AC-3 | `AC3` | [`csp.py`](../master/csp.py) |
| 6.5 | Backtracking-Search | `backtracking_search` | [`csp.py`](../master/csp.py) |
| 6.8 | Min-Conflicts | `min_conflicts` | [`csp.py`](../master/csp.py) |
| 6.11 | Tree-CSP-Solver | `tree_csp_solver` | [`csp.py`](../master/csp.py) |
| 7 | KB | `KB` | [`logic.py`](../master/logic.py) |
| 7.1 | KB-Agent | `KB_Agent` | [`logic.py`](../master/logic.py) |
| 7.7 | Propositional Logic Sentence | `Expr` | [`logic.py`](../master/logic.py) |
| 7.10 | TT-Entails | `tt_entials` | [`logic.py`](../master/logic.py) |
| 7.12 | PL-Resolution | `pl_resolution` | [`logic.py`](../master/logic.py) |
| 7.14 | Convert to CNF | `to_cnf` | [`logic.py`](../master/logic.py) |
| 7.15 | PL-FC-Entails? | `pl_fc_resolution` | [`logic.py`](../master/logic.py) |
| 7.17 | DPLL-Satisfiable? | `dpll_satisfiable` | [`logic.py`](../master/logic.py) |
| 7.18 | WalkSAT | `WalkSAT` | [`logic.py`](../master/logic.py) |
| 2.1 | Environment | `Environment` | [`agents.py`][agents] |
| 2.1 | Agent | `Agent` | [`agents.py`][agents] |
| 2.3 | Table-Driven-Vacuum-Agent | `TableDrivenVacuumAgent` | [`agents.py`][agents] |
| 2.7 | Table-Driven-Agent | `TableDrivenAgent` | [`agents.py`][agents] |
| 2.8 | Reflex-Vacuum-Agent | `ReflexVacuumAgent` | [`agents.py`][agents] |
| 2.10 | Simple-Reflex-Agent | `SimpleReflexAgent` | [`agents.py`][agents] |
| 2.12 | Model-Based-Reflex-Agent | `ReflexAgentWithState` | [`agents.py`][agents] |
| 3 | Problem | `Problem` | [`search.py`][search] |
| 3 | Node | `Node` | [`search.py`][search] |
| 3 | Queue | `Queue` | [`utils.py`][utils] |
| 3.1 | Simple-Problem-Solving-Agent | `SimpleProblemSolvingAgent` | [`search.py`][search] |
| 3.2 | Romania | `romania` | [`search.py`][search] |
| 3.7 | Tree-Search | `tree_search` | [`search.py`][search] |
| 3.7 | Graph-Search | `graph_search` | [`search.py`][search] |
| 3.11 | Breadth-First-Search | `breadth_first_search` | [`search.py`][search] |
| 3.14 | Uniform-Cost-Search | `uniform_cost_search` | [`search.py`][search] |
| 3.17 | Depth-Limited-Search | `depth_limited_search` | [`search.py`][search] |
| 3.18 | Iterative-Deepening-Search | `iterative_deepening_search` | [`search.py`][search] |
| 3.22 | Best-First-Search | `best_first_graph_search` | [`search.py`][search] |
| 3.24 | A\*-Search | `astar_search` | [`search.py`][search] |
| 3.26 | Recursive-Best-First-Search | `recursive_best_first_search` | [`search.py`][search] |
| 4.2 | Hill-Climbing | `hill_climbing` | [`search.py`][search] |
| 4.5 | Simulated-Annealing | `simulated_annealing` | [`search.py`][search] |
| 4.8 | Genetic-Algorithm | `genetic_algorithm` | [`search.py`][search] |
| 4.11 | And-Or-Graph-Search | `and_or_graph_search` | [`search.py`][search] |
| 4.21 | Online-DFS-Agent | `online_dfs_agent` | [`search.py`][search] |
| 4.24 | LRTA\*-Agent | `LRTAStarAgent` | [`search.py`][search] |
| 5.3 | Minimax-Decision | `minimax_decision` | [`games.py`][games] |
| 5.7 | Alpha-Beta-Search | `alphabeta_search` | [`games.py`][games] |
| 6 | CSP | `CSP` | [`csp.py`][csp] |
| 6.3 | AC-3 | `AC3` | [`csp.py`][csp] |
| 6.5 | Backtracking-Search | `backtracking_search` | [`csp.py`][csp] |
| 6.8 | Min-Conflicts | `min_conflicts` | [`csp.py`][csp] |
| 6.11 | Tree-CSP-Solver | `tree_csp_solver` | [`csp.py`][csp] |
| 7 | KB | `KB` | [`logic.py`][logic] |
| 7.1 | KB-Agent | `KB_Agent` | [`logic.py`][logic] |
| 7.7 | Propositional Logic Sentence | `Expr` | [`logic.py`][logic] |
| 7.10 | TT-Entails | `tt_entials` | [`logic.py`][logic] |
| 7.12 | PL-Resolution | `pl_resolution` | [`logic.py`][logic] |
| 7.14 | Convert to CNF | `to_cnf` | [`logic.py`][logic] |
| 7.15 | PL-FC-Entails? | `pl_fc_resolution` | [`logic.py`][logic] |
| 7.17 | DPLL-Satisfiable? | `dpll_satisfiable` | [`logic.py`][logic] |
| 7.18 | WalkSAT | `WalkSAT` | [`logic.py`][logic] |
| 7.20 | Hybrid-Wumpus-Agent | | |
| 7.22 | SATPlan | `SAT_plan` | [`logic.py`](../master/logic.py) |
| 9 | Subst | `subst` | [`logic.py`](../master/logic.py) |
| 9.1 | Unify | `unify` | [`logic.py`](../master/logic.py) |
| 9.3 | FOL-FC-Ask | `fol_fc_ask` | [`logic.py`](../master/logic.py) |
| 9.6 | FOL-BC-Ask | `fol_bc_ask` | [`logic.py`](../master/logic.py) |
| 7.22 | SATPlan | `SAT_plan` | [`logic.py`][logic] |
| 9 | Subst | `subst` | [`logic.py`][logic] |
| 9.1 | Unify | `unify` | [`logic.py`][logic] |
| 9.3 | FOL-FC-Ask | `fol_fc_ask` | [`logic.py`][logic] |
| 9.6 | FOL-BC-Ask | `fol_bc_ask` | [`logic.py`][logic] |
| 9.8 | Append | | |
| 10.1 | Air-Cargo-problem | |
| 10.2 | Spare-Tire-Problem | |
Expand All @@ -87,36 +86,36 @@ Here is a table of algorithms, the figure, name of the code in the book and in t
| 11.5 | Hierarchical-Search | |
| 11.8 | Angelic-Search | |
| 11.10 | Doubles-tennis | |
| 13 | Discrete Probability Distribution | `ProbDist` | [`probability.py`](../master/probability.py) |
| 13.1 | DT-Agent | `DTAgent` | [`probability.py`](../master/probability.py) |
| 14.9 | Enumeration-Ask | `enumeration_ask` | [`probability.py`](../master/probability.py) |
| 14.11 | Elimination-Ask | `elimination_ask` | [`probability.py`](../master/probability.py) |
| 14.13 | Prior-Sample | `prior_sample` | [`probability.py`](../master/probability.py) |
| 14.14 | Rejection-Sampling | `rejection_sampling` | [`probability.py`](../master/probability.py) |
| 14.15 | Likelihood-Weighting | `likelihood_weighting` | [`probability.py`](../master/probability.py) |
| 14.16 | Gibbs-Ask | `gibbs_ask` | [`probability.py`](../master/probability.py) |
| 15.4 | Forward-Backward | `forward_backward` | [`probability.py`](../master/probability.py) |
| 15.6 | Fixed-Lag-Smoothing | `fixed_lag_smoothing` | [`probability.py`](../master/probability.py) |
| 15.17 | Particle-Filtering | `particle_filtering` | [`probability.py`](../master/probability.py) |
| 13 | Discrete Probability Distribution | `ProbDist` | [`probability.py`][probability] |
| 13.1 | DT-Agent | `DTAgent` | [`probability.py`][probability] |
| 14.9 | Enumeration-Ask | `enumeration_ask` | [`probability.py`][probability] |
| 14.11 | Elimination-Ask | `elimination_ask` | [`probability.py`][probability] |
| 14.13 | Prior-Sample | `prior_sample` | [`probability.py`][probability] |
| 14.14 | Rejection-Sampling | `rejection_sampling` | [`probability.py`][probability] |
| 14.15 | Likelihood-Weighting | `likelihood_weighting` | [`probability.py`][probability] |
| 14.16 | Gibbs-Ask | `gibbs_ask` | [`probability.py`][probability] |
| 15.4 | Forward-Backward | `forward_backward` | [`probability.py`][probability] |
| 15.6 | Fixed-Lag-Smoothing | `fixed_lag_smoothing` | [`probability.py`][probability] |
| 15.17 | Particle-Filtering | `particle_filtering` | [`probability.py`][probability] |
| 16.9 | Information-Gathering-Agent | |
| 17.4 | Value-Iteration | `value_iteration` | [`mdp.py`](../master/mdp.py) |
| 17.7 | Policy-Iteration | `policy_iteration` | [`mdp.py`](../master/mdp.py) |
| 17.4 | Value-Iteration | `value_iteration` | [`mdp.py`][mdp] |
| 17.7 | Policy-Iteration | `policy_iteration` | [`mdp.py`][mdp] |
| 17.7 | POMDP-Value-Iteration | | |
| 18.5 | Decision-Tree-Learning | `DecisionTreeLearner` | [`learning.py`](../master/learning.py) |
| 18.8 | Cross-Validation | `cross_validation` | [`learning.py`](../master/learning.py) |
| 18.11 | Decision-List-Learning | `DecisionListLearner` | [`learning.py`](../master/learning.py) |
| 18.24 | Back-Prop-Learning | `BackPropagationLearner` | [`learning.py`](../master/learning.py) |
| 18.34 | AdaBoost | `AdaBoost` | [`learning.py`](../master/learning.py) |
| 18.5 | Decision-Tree-Learning | `DecisionTreeLearner` | [`learning.py`][learning] |
| 18.8 | Cross-Validation | `cross_validation` | [`learning.py`][learning] |
| 18.11 | Decision-List-Learning | `DecisionListLearner` | [`learning.py`][learning] |
| 18.24 | Back-Prop-Learning | `BackPropagationLearner` | [`learning.py`][learning] |
| 18.34 | AdaBoost | `AdaBoost` | [`learning.py`][learning] |
| 19.2 | Current-Best-Learning | |
| 19.3 | Version-Space-Learning | |
| 19.8 | Minimal-Consistent-Det | |
| 19.12 | FOIL | |
| 21.2 | Passive-ADP-Agent | `PassiveADPAgent` | [`rl.py`](../master/rl.py) |
| 21.4 | Passive-TD-Agent | `PassiveTDAgent` | [`rl.py`](../master/rl.py) |
| 21.8 | Q-Learning-Agent | `QLearningAgent` | [`rl.py`](../master/rl.py) |
| 22.1 | HITS | `HITS` | [`nlp.py`](../master/nlp.py) |
| 23 | Chart-Parse | `Chart` | [`nlp.py`](../master/nlp.py) |
| 23.5 | CYK-Parse | `CYK_parse` | [`nlp.py`](../master/nlp.py) |
| 21.2 | Passive-ADP-Agent | `PassiveADPAgent` | [`rl.py`][rl] |
| 21.4 | Passive-TD-Agent | `PassiveTDAgent` | [`rl.py`][rl] |
| 21.8 | Q-Learning-Agent | `QLearningAgent` | [`rl.py`][rl] |
| 22.1 | HITS | `HITS` | [`nlp.py`][nlp] |
| 23 | Chart-Parse | `Chart` | [`nlp.py`][nlp] |
| 23.5 | CYK-Parse | `CYK_parse` | [`nlp.py`][nlp] |
| 25.9 | Monte-Carlo-Localization| |


Expand All @@ -126,16 +125,32 @@ Here is a table of the implemented data structures, the figure, name of the impl

| **Figure** | **Name (in repository)** | **File** |
|:-----------|:-------------------------|:---------|
| 3.2 | romania_map | [`search.py`](../master/search.py) |
| 4.9 | vacumm_world | [`search.py`](../master/search.py) |
| 4.23 | one_dim_state_space | [`search.py`](../master/search.py) |
| 6.1 | australia_map | [`search.py`](../master/search.py) |
| 7.13 | wumpus_world_inference | [`logic.py`](../master/login.py) |
| 7.16 | horn_clauses_KB | [`logic.py`](../master/logic.py) |
| 17.1 | sequential_decision_environment | [`mdp.py`](../master/mdp.py) |
| 18.2 | waiting_decision_tree | [`learning.py`](../master/learning.py) |
| 3.2 | romania_map | [`search.py`][search] |
| 4.9 | vacumm_world | [`search.py`][search] |
| 4.23 | one_dim_state_space | [`search.py`][search] |
| 6.1 | australia_map | [`search.py`][search] |
| 7.13 | wumpus_world_inference | [`logic.py`][logic] |
| 7.16 | horn_clauses_KB | [`logic.py`][logic] |
| 17.1 | sequential_decision_environment | [`mdp.py`][mdp] |
| 18.2 | waiting_decision_tree | [`learning.py`][learning] |


# Acknowledgements

Many thanks for contributions over the years. I got bug reports, corrected code, and other support from Darius Bacon, Phil Ruggera, Peng Shao, Amit Patil, Ted Nienstedt, Jim Martin, Ben Catanzariti, and others. Now that the project is on GitHub, you can see the [contributors](https://github.com/aimacode/aima-python/graphs/contributors) who are doing a great job of actively improving the project. Many thanks to all contributors, especially @darius, @SnShine, and @reachtarunhere.

<!---Reference Links-->
[agents]:../master/agents.py
[csp]:../master/csp.py
[games]:../master/games.py
[grid]:../master/grid.py
[learning]:../master/learning.py
[logic]:../master/logic.py
[mdp]:../master/mdp.py
[nlp]:../master/nlp.py
[planning]:../master/planning.py
[probability]:../master/probability.py
[rl]:../master/rl.py
[search]:../master/search.py
[utils]:../master/utils.py
[text]:../master/text.py