Sliding Puzzle solver and utilities

Implementation Classical Search Algorithms as project for AI Fall 2018

Solving the sliding tiles puzzled using bdf, iddfs, gbfs and a*

A Python project that solves grid navigation with DFS, BFS, IDDFS, GBFS, UCS, and A* searches. Includes CLI metrics and a tkinter visualizer that shows frontier/visited/solution cells as the search runs.

Examples of uninformed (iddfs), infromed (a-star) and local (beam) search.