Notes - Artificial Intelligence MT24, All the algorithms

This is a list of all the (examinable) algorithms presented in [[Course - Artificial Intelligence MT24]]^U. Mainly so that I can see which algorithms I’ve covered in my notes.

• Tree search in general
  • [[Notes - Artificial Intelligence MT24, Uninformed search]]^U
  • Code
  • Example
• Breadth-first search
  • [[Notes - Artificial Intelligence MT24, Uninformed search]]^U
  • Code
  • Example
• Uniform-cost search
  • [[Notes - Artificial Intelligence MT24, Uninformed search]]^U
  • Code
  • Example
• Depth-first search
  • [[Notes - Artificial Intelligence MT24, Uninformed search]]^U
  • Code
  • Example
• Depth-limited search and iterative deepening
  • [[Notes - Artificial Intelligence MT24, Uninformed search]]^U
  • Code
  • Example
• Graph search in general
  • [[Notes - Artificial Intelligence MT24, Uninformed search]]^U
  • Code
  • Example
• Best-first search
  • [[Notes - Artificial Intelligence MT24, Informed search]]^U
  • Code
  • Example
• A* search, tree and graph variants
  • [[Notes - Artificial Intelligence MT24, Informed search]]^U
  • Code
  • Example for tree search
  • Example for graph search
• IDA*
  • [[Notes - Artificial Intelligence MT24, Informed search]]^U
  • Code
  • Example
• Hill climbing
  • [[Notes - Artificial Intelligence MT24, Local search]]^U
  • Code
• Local beam search, non-stochastic and stochastic variants
  • [[Notes - Artificial Intelligence MT24, Local search]]^U
  • Code
• Simulated annealing
  • [[Notes - Artificial Intelligence MT24, Local search]]^U
  • Code
• Regression planning
  • [[Notes - Artificial Intelligence MT24, Planning]]^U
  • Code
  • Example
• Constructing partial order plans
  • [[Notes - Artificial Intelligence MT24, Planning]]^U
  • Code
  • Example
• Planning with propositional logic
  • [[Notes - Artificial Intelligence MT24, Planning with propositional logic]]^U
  • Code
  • Example
• Constructing visibility graphs slowly
  • [[Notes - Artificial Intelligence MT24, Robots]]^U
  • Code
  • Example
• Constructing visibility graphs slightly faster
  • [[Notes - Artificial Intelligence MT24, Robots]]^U
  • Code
  • Example
• Constructing generalised Voronoi diagrams (no detail)
  • [[Notes - Artificial Intelligence MT24, Robots]]^U
  • Code
  • Example
• Constructing probabilistic roadmaps
  • [[Notes - Artificial Intelligence MT24, Robots]]^U
  • Code
  • Example
• Region decomposition
  • [[Notes - Artificial Intelligence MT24, Robots]]^U
  • Code
  • Example
• Backtracking search for CSPs
  • [[Notes - Artificial Intelligence MT24, Constraint satisfaction problems]]^U
  • Code
  • Example
• AC-3 algorithm
  • [[Notes - Artificial Intelligence MT24, Constraint satisfaction problems]]^U
  • Code
  • Example
• Efficient solution of tree-structured CSPs
  • [[Notes - Artificial Intelligence MT24, Constraint satisfaction problems]]^U
  • Code
  • Example
• Cutset conditioning
  • [[Notes - Artificial Intelligence MT24, Constraint satisfaction problems]]^U
  • Code
  • Example
• Tree decompositions
  • [[Notes - Artificial Intelligence MT24, Constraint satisfaction problems]]^U
  • Code
  • Example
• Local search for CSPs
  • Code
  • Example
• Minimax
  • [[Notes - Artificial Intelligence MT24, Perfect information games]]^U
  • Code
  • Example
• Minimax with alpha-beta pruning
  • [[Notes - Artificial Intelligence MT24, Perfect information games]]^U
  • Code
  • Example
• Expectiminimax
  • [[Notes - Artificial Intelligence MT24, Perfect information games]]^U
  • Code
  • Example
• Monte-Carlo tree search
  • [[Notes - Artificial Intelligence MT24, Perfect information games]]^U
  • Code
  • Example
• Averaging over clairvoyance
  • Code
  • Example
• And-Or search
  • [[Notes - Artificial Intelligence MT24, Nondeterministic search]]^U
  • Code
  • Example
• Online depth-first search
  • [[Notes - Artificial Intelligence MT24, Online search]]^U
  • Code
  • Example
• LRTA*
  • [[Notes - Artificial Intelligence MT24, Online search]]^U
  • Code
  • Example