Skip to content

Latest commit

 

History

History
17 lines (14 loc) · 414 Bytes

README.md

File metadata and controls

17 lines (14 loc) · 414 Bytes

A collection of algorithms

Search algorithms:

  1. A*
  2. Beam search
  3. Tabu search
  4. Simulated Annealing
  5. Genetic Algorithm

Applied algorithms:

  1. The knapsack problem solved by dynamic programming. The algorithm returns a set containing the min cost permutation of achieving all possible values.
  2. A sudoku solver.

Other algorithms:

  1. Hidden Markov Model
  2. Pearson Correlation
  3. Q learning