It contains Game playing,Minmax Algorithm,Best-first Search,Tic Tac Toe

1. Name : R. Gomathi Jayam
Class : I M.sc CS
Semester : II
Unit : II
Topic : Heuristic search

3.  The word heuristic is obtain from the Greek
word heuriskein, that means to find or to
discover.
 It can be implemented by using a thumb rule,
a judgment or a guess.
 Trial and error are the simplest form of
heuristic.

4.  This algorithm is used for simple problems
and ineffectual for problems with large space
or complicated.
 Its generate a feasible solution.

5.  Hill climbing , uses mathematical approach
for optimization purpose. It belongs to local
search algorithms.

6.  Game playing is the most important topic in
Artificial Intelligence. It attracts many people
because its well defined states.
 Search techniques are commonly used in game

7.  The Min-Max algorithm is basically used for a
game ,considering of two players such as tic-
tac-toe, checkers, chess and lot.

8.  Best-first search is a searching algorithm
which explores a graph by expanding the most
feasible node chosen according to a specific
norms. This specific type of search is called
as greedy best-first search or pure heuristic
search

9.  Tic- Tac-Toe is a solved game, unless a player
makes a dumb mistake, every game will end
as draw.nb