Async Thunk Not Awaited

You are computing the g-values incorrectly. — closedList.contains(n) and n2.equals(n). Tension: g is actually the length of the path you have already taken. Outcome: Your Node-class doesn't override hashCode() and equals(). | the path list at the end contains nodes with equal G scores — I have an implementation of Astar. Tension: it seems to plot an odd path to the target. | You are computing the g-values incorrectly. — closedList.contains(n) and n2.equals(n). Tension: g is actually the length of the path you have already taken. Outcome: you have some kind of rectangular field with discrete points on it and you want to have the shortest path between two points.