E N D
1. Problem Solving using Search
6. A complete example: The Water Jug Problem
12. General (Generic) Search Algorithm
13. Breadth First SearchEnqueue nodes in FIFO (first-in, first-out) order.
14. Uniform Cost SearchEnqueue nodes in order of cost
15. Depth First SearchEnqueue nodes in LIFO (last-in, first-out) order.
16. Depth-Limited SearchEnqueue nodes in LIFO (last-in, first-out) order. But limit depth to L
17. Iterative Deepening Search IDo depth limited search starting a L = 0, keep incrementing L by 1.
18. Iterative Deepening Search II
19. Bi-directional Search