Artificial Intelligence¶
- Game Playing
- Overview
- Challenge Question Introduction
- Isolation
- Building a Game Tree
- Which are valid moves for O
- Building a Game Tree
- How Do We Tell The Computer Not To Lose?
- MIN and MAX Levels
- Propagating Values Up The Tree
- Computing MIN MAX Values
- Choosing the Best Branch
- Max Number Of Nodes Visited
- Max Moves
- The Branching Factor
- Number of Nodes In a Game Tree
- Depth-Limited Search
- Evaluation Function Intro
- Testing The Evaluation Function
- Testing The Evaluation Function Part 2
- Testing Evaluation Functions
- Quiescent Search
- Iterative Deeping
- Understanding Exponential Time
- Exponential B=3
- Horizon Effect
- Quiz: Good Evaluation Functions
- Evaluating Evaluation Functions
- Alpha-Beta Pruning
- Minimax Quiz
- Alpha Beta Pruning Quiz 1
- Alpha-Beta Pruning Quiz 2
- Searching Complex Games
- 3-Player Games
- 3-Player Games Quiz
- 3-Player Alpha-Beta Pruning
- Multi-player Alpha-Beta Pruning
- Probabilistic Games
- Probabilistic Alpha-Beta Pruning
- Further Watching
- Resources
- Search
- Challenge 1 Tri City Search
- Challenge 2 Rubik’s Cube
- Problem Solving
- What is a problem
- Example Route Finding
- Tree Search
- Tree Search Continued
- Graph Search
- Breadth First Search-1
- Breadth First Search 3
- Uniform Cost Search
- Search Comparison
- Search Comparison - 1
- Search Comparison 2
- More On Uniform Cost
- A* Search
- Admissible Heuristic Function
- Optimistic Heuristic
- State Spaces
- State Spaces 2
- Sliding Blocks Puzzle
- Sliding Blocks Puzzle 2
- Problems With Search
- A Note On Implementation
- References
- Pre-processing for Search
- Search Examples
- Constraint Satisfaction
- Simulated Annealing
- Traveling Salesman Problem
- Methods to help find the global maximum
- 4-Queens
- 5-Queens
- n-Queens Heuristic Function
- n-Queens local Minima
- Local Maxima
- Random Restarts
- Hill-Climbing Quiz
- Step Size Too Small
- Step Size Too Large
- Hill-Climbing Quiz 2
- Annealing
- Simulated Annealing
- Local Beam Search
- Representing n-Queens
- Genetic Algorithms
- GA Crossover
- GA Mutation
- GA Crossover Quiz
- Probability
- Reference
- Bayes Nets
- Challenge Question
- Bayes Network
- Computing Bayes Rule
- Two Test Cancer
- Conditional Independence
- Conditional Independence 2
- Compare
- Absolute and Conditional
- Confounding Cause
- Explaining Away
- Explaining Away 2
- Explaining Away 3
- Conditional Dependence
- General Bayes Network
- D Separation
- D Separation
- Conclusion
- Probabilistic Inference
- Enumeration
- Speeding up Enumeration
- Casual Direction
- Variable Elimination
- Variable Elimination - 2
- Variable Elimination - 3
- Approximate Inference
- Sampling Exercise
- Approximate Inference 2
- Rejection Sampling
- Likelihood Weighting
- Gibbs Sampling
- Machine Learning
- Introduction to Machine Learning
- Challenge Question
- k-Nearest Neighbors
- Cross Validation
- Cross Validation Quiz
- The Gaussian Distribution
- Central Limit Theorem
- Grasshoppers Vs Katydids
- Gaussians Quiz
- Decision Boundaries
- Recognition Quiz
- Decision Boundaries
- Error
- Bayes Classifier
- Bayes Rule Quiz
- Naive Bayes
- Maximum Likelihood
- Naive Bayes Quiz
- No Free Lunch
- Naive Bayes vs kNN
- Using a Mixture of Gaussians
- Generalizations
- Decision Tree with Discrete Information
- Decision Tree Quiz 1
- Decision Trees with Continuos Information
- Minimum Description Length
- Entropy
- Information Gain
- Decision Tree Quiz 2
- Random Forests
- Boosting
- Boosting Quiz
- Neural Nets
- Neural Nets Quiz
- Multilayer Nets
- Perceptron Learning
- Expressiveness of Preceptron
- Multilayer Perceptron
- Back-Propagation
- Deep Learning
- Unsupervised Learning
- k-Means and EM
- EM and Mixture of Gaussians
- Resources
- Lesson 1 Challenge #7: Expectimax 2
- Short search questions
- Searching Rubik’s Cube
- Lesson 3 Challenge 2
- Problem 1
- Problem 2
- Problem 3
- Bayes Net Calculation
- Numpy References
- Logic and Planning
- Truth Tables
- Truth Table Question
- Quiz: Propositional Logic Question
- Terminology
- Propositional Logic Limitations
- First Order Logic
- Model
- Syntax
- Vacumn World
- FOL Question
- FOL Question 2
- Problem Solving vs Planning
- Planning vs Execution
- Vacuum Cleaner World
- Sensorless Vacuum Cleaner Problem
- Partially Observable Vacuum Cleaner Example
- Stochastic Environment Problem
- Infinite Sequences
- Finding A Successful Plan
- Finding A Successful Plan Question
- Solving Problem via Mathematical Notation
- Tracking The Predict Update Cycle
- Classical Planning 1
- Classical Planning 2
- Progression Search
- Regression Search
- Regression Vs Progression
- Plan Space Search
- Sliding Puzzle Example
- Situation Calculus 1
- Situation Calculus 2
- Planning under uncertainty
- Introduction
- Planning Under Uncertainty MDP
- Robot Tour Guide Examples
- MDP Grid World
- Problems with Conventional Planning 1
- Branching Factor is too large
- Problems With Conventional Planning 2
- Quiz: Policy Question 1
- Quiz: Policy Question 2
- Quiz: Policy Question 3
- MDP And Costs
- Value Iteration 1
- Value Iteration 2
- Value Iteration 3
- Quiz: Deterministic Question 1
- Quiz: Deterministic Question 2
- Quiz: Deterministic Question 3
- Quiz: Stochastic Question 1
- Quiz: Stochastic Question 2
- Value Iterations and Policy 1
- Value Iterations And Policy 2
- Markov Decision Process Conclusion
- Partial Observability Introduction
- POMDP Vs MDP
- POMDP
- Planning Under Uncertainity Conclusion
- Pattern Recognition Through Time
- AI Resources
- Math for AI
Course Syllabus¶
Resources¶
Visualizing Probability and Statistics - http://students.brown.edu/seeing-theory/
Lecture Slides from Book - http://ai.stanford.edu/~latombe/cs121/2011/schedule.htm
Practise Alpha Beta Pruning - http://inst.eecs.berkeley.edu/~cs61b/fa14/ta-materials/apps/ab_tree_practice/
Andrew Moore CMU - http://www.cs.cmu.edu/~awm/index.html