Professional Documents
Culture Documents
Contents
Introduction
Need
of classification
Maze problems
Existing solution approaches
Classification scheme
Proposed algorithms
Comparative analysis
Conclusion
Introduction
Maze
Maze
Well
PSO
Need of classification
Classification
Maze
Most
No
Maze problems
1)
2)
3)
4)
5)
6)
7)
8)
9)
10)
Knight tour
Tic Tac Toe
N-queen
Sudoku
Light up
Rat in a Maze
N- puzzle
Slither- link
Tetris
Pac-man
Classification scheme
1.
2.
3.
Fixed
Dynamic
Empty
Filled
Fixed
Dynamic
Classification
Scheme(Contd..)
1.
2.
3.
4.
Class
Class
Class
Class
Existing approaches
Ant colony based algorithm for Knights tour
Contd
Backtracking based algorithm for Knights
tour
Select
2)
3)
4)
Sol[k]=ant(k).buildsolution()
5)
6)
If (cost(Sol[k])<best) best=cost(Sol[k])
7)
8)
If(cost(Sol[k])==best)
9)
ant(k).update pheromone()
Algorithms Proposed
1)
2)
3)
4)
5)
The next move by the algorithm will be on the node having the
highest pheromone value.
6)
Algorithm proposed(contd)
The paths of all n ants are stored and the path with the end
node as the
destination node with the shortest node count
is considered as the result.
6)
8x8
0.037 approx.
0.031 approx.
16 x 16
2.8 approx.
24 x 24
37.19 approx.
19.5 approx.
Difficult(in sec)
ACO
Easy (in sec)
Difficult(in sec)
8x8
30(approx)
36(approx)
30(approx)
32(approx)
16 x 16
40(approx)
49(approx)
36(approx)
38(approx)
24 x 24
55(approx)
64(approx)
50(approx)
51(approx)
10 x 10
0.05 approx.
9approx.
15 x 15
5.2 approx.
20 approx.
25 x 25
20.9 approx.
120 approx.
ACO Based
Draw(%)
Win(%)
Level
Easy
20
80
95
Medium
30
70
92
Hard
45
55
12
82
Accuracy
Simulated Annealing
0.64
40.20
Genetic algorithm
0.13
75.75
Hybrid
0.47
67.66
[20]
492.8
182.0
400.0
10
947.8
472.5
4910.0
30
2159.9
4654.5
91790.0
50
2848.6
22662.5
1759230.0
75
6091.3
81030.0
571170.0
100
7872.7
206910.0
887770.0
200
21708.2
2399940.0
2287960.0
Conclusion
After
the
Backtracking