ustcliuc/8-puzzle
Recursive Best First Search and Iterative Depth First Search
Use dynamic programming to solve matrix chain multiplication problem and longest common substring problem (LCS problem)
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
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