Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 199 Bytes

File metadata and controls

2 lines (2 loc) · 199 Bytes

N-Puzzle-Problem-IDS-UCS-DFS-BFS-

This program basically solve N-puzzle problem using all 4 approaches (Breadth First Search, Depth First Search, Uniform First Search, Iterative Deepening Search)