Artificial Intelligence Search Methods For Problem Solving

Artificial Intelligence: Introduction

Introduction to AI

AI Introduction: Philosophy

Introduction: Philosophy

State Space Search - Introduction

Search - DFS and BFS

Search DFID

Heuristic Search

Hill climbing

Solution Space Search,Beam Search

TSP Greedy Methods

Tabu Search

Optimization - I (Simulated Annealing)

Optimization II (Genetic Algorithms)

Population based methods for Optimization

Population Based Methods II

Branch and Bound, Dijkstra's Algorithm

A* Algorithm

Admissibility of A*

A* Monotone Property, Iterative Deeping A*

Recursive Best First Search, Sequence Allignment

Pruning the Open and Closed lists

Problem Decomposition with Goal Trees

AO* Algorithm

Game Playing

Game Playing- Minimax Search

Game Playing - AlphaBeta

Game Playing-SSS *

Rule Based Systems

Inference Engines

Rete Algorithm

Planning

Planning FSSP, BSSP

Goal Stack Planning Sussman's Anomaly

Non-linear planning

Plan Space Planning

GraphPlan

Constraint Satisfaction Problems

CSP Continued

Knowlege Based Systems

Knowlege Based Systems PL

Propositional Logic

Resolution Refutation for PL

First Order Logic (FOL)

Reasoning in FOL

Backward Chaining

Resolution for FOL