BSCS3003 · Knowledge Base
Ai Search Notes
33
Concepts
0
Facts
0
Procedures
concept
1m
01 - 🧠 History & Philosophy of AI
concept
1m
02 - 🤖 Intelligent Agents & Problem Solving
concept
1m
03 - 🧠 AI Philosophy & Approaches
concept
1m
04 - 🌐 State Space Search & Blind Search
concept
1m
05 - ⚙️ Configuration vs. Planning Problems
concept
1m
06 - 🌐 Implicit vs. Explicit State Spaces
concept
1m
07 - ↔️ Breadth-First Search (BFS)
concept
1m
08 - 🔄 Depth-First Iterative Deepening (DFID)
concept
1m
09 - ⭐ Best First Search
concept
1m
10 - 🎨 Designing Heuristic Functions
concept
1m
11 - 📏 Heuristic Functions- Hamming & Manhattan
concept
1m
12 - ⛰️ Hill Climbing
concept
1m
13 - 🔄 Local Search & Metaheuristics Overview
concept
1m
14 - ✅ SAT, CNF & Local Search
concept
1m
15 - 🌡️ Simulated Annealing & Tabu Search
concept
1m
16 - 🔦 Beam Search & Variable Neighborhood Descent
concept
1m
17 - 🧬 Genetic Algorithms
concept
1m
18 - 🐜 ACO & Emergent Systems
concept
1m
19 - 🌿 Branch & Bound
concept
1m
20 - ✅ Admissibility & Consistency in A-
concept
1m
21 - ⭐ A- Search
concept
1m
22 - 🌿 TSP Branch & Bound
concept
1m
23 - ⏩ Weighted A- & IDA-
concept
1m
24 - 📐 Monotone Condition & Pruning in A-
concept
1m
25 - 🎯 SMGS & Beam Stack Search
concept
1m
26 - 🧬 Sequence Alignment & Needleman-Wunsch
concept
1m
27 - ♟️ Minimax & Alpha-Beta Pruning
concept
1m
28 - ⭐ SSS- Algorithm
concept
1m
29 - 🤖 Automated Planning
concept
1m
30 - 🧱 Blocks World & Multi-Armed Robots
concept
1m
31 - 🔀 Problem Decomposition & AO-
concept
1m
32 - 📊 Graphplan & Plan Space Planning
concept
1m