Fundamentals
Search Techniques
Algorithms
Tree & ANN
Classifiers
100
  1. Playing a game on Computer
  2. Making a machine Intelligent
  3. Programming on Machine with your Own Intelligence
  4. Putting your intelligence in Machine

Artificial Intelligence is about_____.

100

 represents a set of possible solutions, which a system may have.

Search space

100
  • It is called the_________search   because it starts from the root node and follows each path to its greatest depth node before moving to the next path.

depth-first search

100


Knowledge Representation

200

John McCarthy was a pioneer in the AI field and known as the father of __________. He was not only the known as the father of AI but also invented the term Artificial Intelligence.

Who is known as the -Father of AI"?

200

A _____representation of search problem is called Search tree. The root of the search tree is the root node which is corresponding to the initial state.

tree

200

___________ search algorithm always selects the path which appears best at that moment

Greedy best-first

200


AI Knowledge Cycle

300

A game tree is a directed graph whose nodes represent the positions in Game and edges represent the moves. To make any decision, the game tree uses________ algorithm

Min/Max algorithm

300

 _____________algorithms use domain knowledge.

Informed search

300


A* Search Algorithm:

300

 It only evaluates the neighbor node state at a time and selects the first one which optimizes current cost and set it as a current state.

Simple Hill Climbing: