BSCS3003
33 Internal Entities Declared
📄
01 - 🧠 History & Philosophy of AIAccess ->
📄
02 - 🤖 Intelligent Agents & Problem SolvingAccess ->
📄
03 - 🧠 AI Philosophy & ApproachesAccess ->
📄
04 - 🌐 State Space Search & Blind SearchAccess ->
📄
05 - ⚙️ Configuration vs. Planning ProblemsAccess ->
📄
06 - 🌐 Implicit vs. Explicit State SpacesAccess ->
📄
07 - ↔️ Breadth-First Search (BFS)Access ->
📄
08 - 🔄 Depth-First Iterative Deepening (DFID)Access ->
📄
09 - ⭐ Best First SearchAccess ->
📄
10 - 🎨 Designing Heuristic FunctionsAccess ->
📄
11 - 📏 Heuristic Functions- Hamming & ManhattanAccess ->
📄
12 - ⛰️ Hill ClimbingAccess ->
📄
13 - 🔄 Local Search & Metaheuristics OverviewAccess ->
📄
14 - ✅ SAT, CNF & Local SearchAccess ->
📄
15 - 🌡️ Simulated Annealing & Tabu SearchAccess ->
📄
16 - 🔦 Beam Search & Variable Neighborhood DescentAccess ->
📄
17 - 🧬 Genetic AlgorithmsAccess ->
📄
18 - 🐜 ACO & Emergent SystemsAccess ->
📄
19 - 🌿 Branch & BoundAccess ->
📄
20 - ✅ Admissibility & Consistency in A-Access ->
📄
21 - ⭐ A- SearchAccess ->
📄
22 - 🌿 TSP Branch & BoundAccess ->
📄
23 - ⏩ Weighted A- & IDA-Access ->
📄
24 - 📐 Monotone Condition & Pruning in A-Access ->
📄
25 - 🎯 SMGS & Beam Stack SearchAccess ->
📄
26 - 🧬 Sequence Alignment & Needleman-WunschAccess ->
📄
27 - ♟️ Minimax & Alpha-Beta PruningAccess ->
📄
28 - ⭐ SSS- AlgorithmAccess ->
📄
29 - 🤖 Automated PlanningAccess ->
📄
30 - 🧱 Blocks World & Multi-Armed RobotsAccess ->
📄
31 - 🔀 Problem Decomposition & AO-Access ->
📄
32 - 📊 Graphplan & Plan Space PlanningAccess ->
📄
33 - 🧠 Rule-Based Expert SystemsAccess ->