1. A*
2. Beam search
3. Tabu search

1. The knapsack problem solved by dynamic programming.
2. Local search applied to the k-queens problem.
3. A sudoku solver.

1. A very beginner friendly and readable neural netork implementation.
2. And a much faster numpy implementation.

The knapsack algorithm returns a set which contains the least "heavy" approach to achieving every possible cost value.