Implementation of path finding algorithms

S - start point
E - end point
@ - path
# - obstacle
1 - cost

BFS (Flood fill)

Best First Search (Greedy algorithm)

manhattan vs euclidean heuristic distance

Dijkstra search

finds the cheapest path (. is 1 by default)

A* vs B*

in some cases B* can't find the shortest path, A* always finds the shortest or cheapest path