I'm trying to build a maze solver using A* algorithm. The maze is a grid with movement allowed in 4 directions (up, down, left, right). If there's a starting cell (x1, y1) and a destination (x2, y2), which of these should I make my heuristic?
- Euclidean Distance
- (x2-x1)^2 + (y2-y1)^2
- abs(x2-x1) + abs(y2-y1)
I'm leaning towards the euclidean distance because it seems intuitive but am unsure.