ConceptAI & ML
Search tree
A tree structure representing all possible plans and their outcomes starting from a root node.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Pieter Abbeel
Lectures that assume it
16The first 12 are shown.
- Streams, Part 1
- Speculations on Test-Time Scaling for Large Language Models (o1)
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Search with Other Agents: Minimax
- Exploration of advanced topics in deep reinforcement learning
- Learning: Near Misses and Felicity Conditions in AI
- Reasoning: Goal Trees and Problem Solving
- Classic Games
- EXODUS + Volcano Query Optimizer Generators
- Search with Other Agents: Expectimax, Utilities
- Speculative Parallelism & Leiserchess
- Search: Depth-First, Hill Climbing, Beam Search
Connections
26The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Search problem
- State space graph
- Successor function
- Monte Carlo tree search
- Backtracking search
- Breadth-first search
Show 2 moreShow fewer
Lectures18
- Uninformed Search
- A* Search and Heuristics
- Streams, Part 1
- Speculations on Test-Time Scaling for Large Language Models (o1)
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Search with Other Agents: Minimax
Show 12 moreShow fewer
- Exploration of advanced topics in deep reinforcement learning
- Learning: Near Misses and Felicity Conditions in AI
- Reasoning: Goal Trees and Problem Solving
- Classic Games
- EXODUS + Volcano Query Optimizer Generators
- Search with Other Agents: Expectimax, Utilities
- Speculative Parallelism & Leiserchess
- Search: Depth-First, Hill Climbing, Beam Search
- Integrating Learning and Planning
- Constraint Satisfaction Problems (CSPs) Part 2/2
- Robotics, Language, and Vision
- Join Ordering: Top-Down / Transformational