ustcliuc/Dynamic-Programming
Use dynamic programming to solve matrix chain multiplication problem and longest common substring problem (LCS problem)
Discovered public repositories for ustcliuc in the GitHub catalog.
Use dynamic programming to solve matrix chain multiplication problem and longest common substring problem (LCS problem)
Recursive Best First Search and Iterative Depth First Search
Various solutions to find a solution of N queens puzzle including Backtracking, Random Search, Hill Climbing Search and Min-conflicts Search with optimized initialization