Académique Documents
Professionnel Documents
Culture Documents
Incremental Approach
Divide & Conquer Approach
Greedy Approach
Dynamic Programming
Backtracking
2
Backtracking
? dead end
dead end
dead end
?
start ? ? dead end
dead end
?
success!
8
N-Queens Problem
9
The N-Queens Problem
10
The N-Queens Problem
11
The N-Queens Problem
12
The 8-Queens Example
13
Let’s look at it run (1 queen Problem)
14
(2 queen Problem)
X X
15
(3 queen Problem)
X X X
X X X
X
X
3 queen problem ::: No Solution exist 16
(4 queen Problem)
4 columns
4 rows
17
(4 queen Problem)
4 columns
4 rows
Need Backtrack…..
18
(4 queen Problem)
4 columns
4 rows
4 columns
4 rows
Solved…..
20
State Space Tree
21
(8 queen Problem)
8 columns
8 rows
22
Algorithm for N Queen problem
27
Try it for
14 Queens Remainder = 2
2,4,6,8,10,12,14,3,1,7,9,11,13,5
15 Queens Remainder = 3
4,6,8,10,12,14,2,5,7,9,11,13,15,1,3
20 Queens Remainder = 8
2,4,6,8,10,12,14,16,18,20,3,1,7,5,11,9,15,13,19,17
28
29
What is Graph Coloring?
30
Example
31
State Space Tree
32
Solution
33
Example-2
34
Hamiltonian Cycle
35
State Space Tree
36
Sum of Subset Problem
38
Chapter Summary