/Shortest-Path-in-2D-Matrix

This project aims to solve the problem of finding shortest path in 2D Matrix using Blind Search (BFS, DFS, Uniform cost, Deep-limited, Iterative Deepening) and Heuristic Search (Best first search, A* search, Hill Climbing, Beam search)

Primary LanguageJava

Watchers