12.2.1 Breadth First Search (BFS) 314
12.2.2 Depth First Search (DFS) 315
12.3 The Backtracking Strategy 316
12.3.1 Example 1: 8-Queens problem 318
12.4 Backtracking Framework 320
12.4.1 Effi ciency of backtracking 321
12.4.2 Example 2: M-colouring problem 323
12.4.3 Example 3: Hamiltonian circuits 325
12.5 Some Typical State Spaces 326
12.5.1 Constructing all subsets 326
12.5.2 Constructing all permutations 326
12.5.3 Constructing all paths in a graph 327
12.5.4 Bandwidth minimization 328
12.5.5 Covering chess boards 330
12.5.6 Convex Hull (Graham’s scan) 331
Summary 336
Key Terms 337
Exercises 337
Web Resources 339
Chapter 13 Natural Algorithms—GA, SA, ANN, TS 340
13.1 ...