searching algorithms in C#: free ebook

A first draft can be found at:
http://www.frontiernet.net/~fredm/dps/Contents.htm

and contains:



Table of Contents:

Chapter
Preface

1 Permutations
Traveling Salesman; Machine Sequencing; 8-Queens;
Quadratic Assignment

2 Combinations and Cartesian Product
Sublists of a List; Round-Robin Tournament; Nested
Parentheses; Combinations
of Combinations

3 Depth First Search
8-Queens; Maze; Parser

4 Variations on Depth First Search
Divide and Conquer: Parenthesizing a List; Branch
and Bound: Knapsack

5 Dynamic Programming
Knapsack; Lot Sizing

6 Breadth First Search
BFS: 8-Queens; Best-First: Knapsack; Greedy Search:
Traveling Salesman; Beam
Search: Traveling Salesman

7 A*
Knapsack; 15-Puzzle

8 Game Trees
Minimax: Reversi; Alpha/Beta Pruning: Reversi

9 Simulated Annealing
Traveling Salesman

Bibliography

Source Code



Source code may be freely used, copied, and modified. However, no warranty
is given as to its suitability or accuracy. The source code was compiled
under Microsoft's Express C#, Beta 2, and uses generics, iterators, and
anonymous methods.