diff --git a/README.md b/README.md index b891ae115..5791f59e7 100644 --- a/README.md +++ b/README.md @@ -26,99 +26,99 @@ When complete, this project will have Python code for all the pseudocode algorit Here is a table of algorithms, the figure, name of the algorithm in the book and in the repository, and the file where they are implemented in the repository. 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. An asterisk next to the file name denotes the algorithm is not fully implemented. -| **Figure** | **Name (in 3rd edition)** | **Name (in repository)** | **File** -|:--------|:-------------------|:---------|:-----------| -| 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 | `HybridWumpusAgent` | [`logic.py`][logic]\* | -| 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 |`air_cargo` |[`planning.py`][planning]| -| 10.2 | Spare-Tire-Problem | `spare_tire` |[`planning.py`][planning]| -| 10.3 | Three-Block-Tower | `three_block_tower` |[`planning.py`][planning]| -| 10.7 | Cake-Problem | `have_cake_and_eat_cake_too` |[`planning.py`][planning]| -| 10.9 | Graphplan | `GraphPlan` |[`planning.py`][planning]| -| 10.13 | Partial-Order-Planner | | -| 11.1 | Job-Shop-Problem-With-Resources | `job_shop_problem` |[`planning.py`][planning]| -| 11.5 | Hierarchical-Search | `hierarchical_search` |[`planning.py`][planning]| -| 11.8 | Angelic-Search | | -| 11.10 | Doubles-tennis | `double_tennis_problem` |[`planning.py`][planning]| -| 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`][mdp] | -| 17.7 | Policy-Iteration | `policy_iteration` | [`mdp.py`][mdp] | -| 17.7 | POMDP-Value-Iteration | | | -| 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 | `current_best_learning` | [`knowledge.py`](knowledge.py) | -| 19.3 | Version-Space-Learning | `version_space_learning` | [`knowledge.py`](knowledge.py) | -| 19.8 | Minimal-Consistent-Det | | -| 19.12 | FOIL | | -| 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| | +| **Figure** | **Name (in 3rd edition)** | **Name (in repository)** | **File** | **Tests** +|:--------|:-------------------|:---------|:-----------|:-------| +| 2.1 | Environment | `Environment` | [`agents.py`][agents] | | +| 2.1 | Agent | `Agent` | [`agents.py`][agents] | Done | +| 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] | Done | +| 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] | Done | +| 3 | Node | `Node` | [`search.py`][search] | Done | +| 3 | Queue | `Queue` | [`utils.py`][utils] | Done | +| 3.1 | Simple-Problem-Solving-Agent | `SimpleProblemSolvingAgent` | [`search.py`][search] | | +| 3.2 | Romania | `romania` | [`search.py`][search] | Done | +| 3.7 | Tree-Search | `tree_search` | [`search.py`][search] | Done | +| 3.7 | Graph-Search | `graph_search` | [`search.py`][search] | Done | +| 3.11 | Breadth-First-Search | `breadth_first_search` | [`search.py`][search] | Done | +| 3.14 | Uniform-Cost-Search | `uniform_cost_search` | [`search.py`][search] | Done | +| 3.17 | Depth-Limited-Search | `depth_limited_search` | [`search.py`][search] | Done | +| 3.18 | Iterative-Deepening-Search | `iterative_deepening_search` | [`search.py`][search] | Done | +| 3.22 | Best-First-Search | `best_first_graph_search` | [`search.py`][search] | | +| 3.24 | A\*-Search | `astar_search` | [`search.py`][search] | Done | +| 3.26 | Recursive-Best-First-Search | `recursive_best_first_search` | [`search.py`][search] | Done | +| 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] | Done | +| 4.11 | And-Or-Graph-Search | `and_or_graph_search` | [`search.py`][search] | Done | +| 4.21 | Online-DFS-Agent | `online_dfs_agent` | [`search.py`][search] | | +| 4.24 | LRTA\*-Agent | `LRTAStarAgent` | [`search.py`][search] | Done | +| 5.3 | Minimax-Decision | `minimax_decision` | [`games.py`][games] | Done | +| 5.7 | Alpha-Beta-Search | `alphabeta_search` | [`games.py`][games] | Done | +| 6 | CSP | `CSP` | [`csp.py`][csp] | Done | +| 6.3 | AC-3 | `AC3` | [`csp.py`][csp] | Done | +| 6.5 | Backtracking-Search | `backtracking_search` | [`csp.py`][csp] | Done | +| 6.8 | Min-Conflicts | `min_conflicts` | [`csp.py`][csp] | | +| 6.11 | Tree-CSP-Solver | `tree_csp_solver` | [`csp.py`][csp] | Done | +| 7 | KB | `KB` | [`logic.py`][logic] | Done | +| 7.1 | KB-Agent | `KB_Agent` | [`logic.py`][logic] | Done | +| 7.7 | Propositional Logic Sentence | `Expr` | [`logic.py`][logic] | Done | +| 7.10 | TT-Entails | `tt_entails` | [`logic.py`][logic] | Done | +| 7.12 | PL-Resolution | `pl_resolution` | [`logic.py`][logic] | Done | +| 7.14 | Convert to CNF | `to_cnf` | [`logic.py`][logic] | Done | +| 7.15 | PL-FC-Entails? | `pl_fc_resolution` | [`logic.py`][logic] | Done | +| 7.17 | DPLL-Satisfiable? | `dpll_satisfiable` | [`logic.py`][logic] | Done | +| 7.18 | WalkSAT | `WalkSAT` | [`logic.py`][logic] | Done | +| 7.20 | Hybrid-Wumpus-Agent | `HybridWumpusAgent` | [`logic.py`][logic]\* | | +| 7.22 | SATPlan | `SAT_plan` | [`logic.py`][logic] | Done | +| 9 | Subst | `subst` | [`logic.py`][logic] | Done | +| 9.1 | Unify | `unify` | [`logic.py`][logic] | Done | +| 9.3 | FOL-FC-Ask | `fol_fc_ask` | [`logic.py`][logic] | Done | +| 9.6 | FOL-BC-Ask | `fol_bc_ask` | [`logic.py`][logic] | Done | +| 9.8 | Append | | | | +| 10.1 | Air-Cargo-problem | `air_cargo` | [`planning.py`][planning] | Done | +| 10.2 | Spare-Tire-Problem | `spare_tire` | [`planning.py`][planning] | Done | +| 10.3 | Three-Block-Tower | `three_block_tower` | [`planning.py`][planning] | Done | +| 10.7 | Cake-Problem | `have_cake_and_eat_cake_too` | [`planning.py`][planning] | Done | +| 10.9 | Graphplan | `GraphPlan` | [`planning.py`][planning] | | +| 10.13 | Partial-Order-Planner | | | | +| 11.1 | Job-Shop-Problem-With-Resources | `job_shop_problem` | [`planning.py`][planning] | Done | +| 11.5 | Hierarchical-Search | `hierarchical_search` | [`planning.py`][planning] | | +| 11.8 | Angelic-Search | | | | +| 11.10 | Doubles-tennis | `double_tennis_problem` | [`planning.py`][planning] | | +| 13 | Discrete Probability Distribution | `ProbDist` | [`probability.py`][probability] | Done | +| 13.1 | DT-Agent | `DTAgent` | [`probability.py`][probability] | | +| 14.9 | Enumeration-Ask | `enumeration_ask` | [`probability.py`][probability] | Done | +| 14.11 | Elimination-Ask | `elimination_ask` | [`probability.py`][probability] | Done | +| 14.13 | Prior-Sample | `prior_sample` | [`probability.py`][probability] | | +| 14.14 | Rejection-Sampling | `rejection_sampling` | [`probability.py`][probability] | Done | +| 14.15 | Likelihood-Weighting | `likelihood_weighting` | [`probability.py`][probability] | Done | +| 14.16 | Gibbs-Ask | `gibbs_ask` | [`probability.py`][probability] | | +| 15.4 | Forward-Backward | `forward_backward` | [`probability.py`][probability] | Done | +| 15.6 | Fixed-Lag-Smoothing | `fixed_lag_smoothing` | [`probability.py`][probability] | Done | +| 15.17 | Particle-Filtering | `particle_filtering` | [`probability.py`][probability] | Done | +| 16.9 | Information-Gathering-Agent | | | +| 17.4 | Value-Iteration | `value_iteration` | [`mdp.py`][mdp] | Done | +| 17.7 | Policy-Iteration | `policy_iteration` | [`mdp.py`][mdp] | Done | +| 17.7 | POMDP-Value-Iteration | | | | +| 18.5 | Decision-Tree-Learning | `DecisionTreeLearner` | [`learning.py`][learning] | Done | +| 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] | Done | +| 18.34 | AdaBoost | `AdaBoost` | [`learning.py`][learning] | | +| 19.2 | Current-Best-Learning | `current_best_learning` | [`knowledge.py`](knowledge.py) | Done | +| 19.3 | Version-Space-Learning | `version_space_learning` | [`knowledge.py`](knowledge.py) | Done | +| 19.8 | Minimal-Consistent-Det | | | +| 19.12 | FOIL | | | +| 21.2 | Passive-ADP-Agent | `PassiveADPAgent` | [`rl.py`][rl] | Done | +| 21.4 | Passive-TD-Agent | `PassiveTDAgent` | [`rl.py`][rl] | Done | +| 21.8 | Q-Learning-Agent | `QLearningAgent` | [`rl.py`][rl] | Done | +| 22.1 | HITS | `HITS` | [`nlp.py`][nlp] | Done | +| 23 | Chart-Parse | `Chart` | [`nlp.py`][nlp] | | +| 23.5 | CYK-Parse | `CYK_parse` | [`nlp.py`][nlp] | Done | +| 25.9 | Monte-Carlo-Localization| `monte_carlo_localization` | [`probability.py`][probability] | Done | # Index of data structures pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy