- A*
- Beam search
- Tabu search
- Simulated Annealing
- Genetic Algorithm
- The knapsack problem solved by dynamic programming. The algorithm returns a set containing the min cost permutation of achieving all possible values.
- A sudoku solver.
- Hidden Markov Model
- Pearson Correlation
- Q learning