Artificial Intelligence Algorithm

1. ACTIVE LEARNING
ASSIGNMENT
FOR THE SUBJECT
“ARTIFICIAL INTELLIGENCE”
Simulated Annealing in N - Queens
Guided By : -
Prof. G. J. Sahani
Prepared By :-
Hemant H. Chetwani
(130410107010 TY CE-II)

2. Simulated Annealing - Definition
It is a technique of optimization based on the analogy
between the way the metal cools and freezes in a
minimum energy of the crystalline structure (the
annealing process) and the search for a minimum in a
more general system.

3. Natural Motivation
• Properties of structure depend on cooling factor after the substance was
heated to melting point. Slow cooling – large crystals are formed, that is
useful for a substance structure. Spasmodic cooling– the weak structure is
formed.
• «Agitation» at a heat is accompanied by high molecular activity in physical
system.
Disturbance
Disturbance

4. • The initial solution
• For the majority of problems the initial
solution is casual.
• Solution estimation
• The solution estimation consists of
decoding of the current solution and
performance of the necessary act,
allowing to fathom its expediency for the
solution of the given problem.
• Casual search of the solution
• Solution search begins with copying of
the current solution in the working
solution which is any way inoculated
further.
Create the initial
solution
Evaluate the solution
Change the solution
in a random way
Evaluate the new
solution
Criterion of the
admission
Reduce temperature
The current solution
The working solution
The best solution
Simulated Annealing
SA ALGORITHM

5. • Criterion of the admission
•At this stage of algorithm two solutions are available. First - the current
solution, second - the working solution. Certain energy (E) is connected with
each solution and represents its efficiency.
• The working solution is accepted as the current solution if :
• In the beginning of search the temperature has the greatest value and  is
close to 1. Therefore the sampling probability of the solution increasing value
of energy is great. Taking of such solutions corresponds to movement to saddle
point B, instead of to minimum A. As approaching a global minimum the
temperature decreases and probability of increase in energy drops.
SA ALGORITHM

6. • The N queens puzzle is the problem
of placing N chess queens on an
N×N chessboard so that none of
them is able to capture any other
using the standard chess queen's
moves.:
SA ALGORITHM
One of 92 solutions of 8 queens puzzle

7. EXAMPLE OF SOLUTION OF 40 QUEENS
PUZZLE

8. • Absence of restrictions of the form of the minimizing function.
• Search of a global minimum.
• Efficiency in a solving of the various classes of problems demanding
optimization.
CONCLUSION
ADVANTAGES OF ANNEALING
ANNEALING DEFICIENCIES
• The demand of infinitely slow cooling, in practice meaning slow work of
algorithm.
• Complexity of tuning.

9. RANGES OF APPLICATION
• Way Creation
• Image Reconstruction
• Assignment Routine And Planning
• Network Placement
• Global Routing
• Detection And Recognition Of Visual Targets
• Design Of Special Digital Filters