1

Module-1 : Course Overview

• 1.Course Overview

2

Module-2 : Introduction

• 2.Introduction

3

Module-3 : Basic

• 3. Propositional Logic
• 4. Bayes Theorm
• 5. Canonical Genetic Algorithm
• 6. Genetic algorithm
• 7. Mating
• 8. Selection

4

Module-4 : Hill Climbing

• 9.Hill Climbing Introduction
• 10.Features of Hill Climbing
• 11.State Space Diagram for Hill Climbing
• 12.Types of Hill Climbing Algorithm
• 13.Problems in Hill Climbing Algorithm
• 14.Stimulated Anealing in Hill Climbing
• 15.Minmax Algorithm

5

Module-5 : Algorithm

• 16.Working Principal of Minimax Algorithm
• 17.Properties of Minmax Algorithm
• 18.Limitations of Minmax Algorithm

6

Module-5 : Planning

• 19.Planning in Artificial Intelligence

7

Module-6 : Alpha beta Pruning

• 20.Introduction to Alpha beta Pruning
• 21.Two player Search tree to understand the working of Alpha Beta Pruning
• 22.Move Ordering in Alpha Beta Pruning
• 23.Rules to find Good Ordering in Pruning

8

Module-7 : Reasoning

• 24.Reasoning

9

Module-8 : Simulated

• 25.Simulated Annealing