Use cell hueristic for tentative g

2024-02-03 00:51:41 -08:00 · 2024-02-03 00:51:41 -08:00 · 182214c6d0
commit 182214c6d0
parent a9fba17943
1 changed files with 1 additions and 1 deletions
--- a/sauce/astar.go
+++ b/sauce/astar.go
@ -64,7 +64,7 @@ func FindPath(w *World, fromX, fromY int, toX, toY int) ([]Node, bool) {

 		// Iterate over neighbors.
 		for _, neighbor := range neighbors {
-			tentativeG := current.g + 1
+			tentativeG := current.g + 1 + int(w.At(int(neighbor.X), int(neighbor.Y)).Hueristic)
 			distance := int(math.Abs(float64(neighbor.X)-float64(toX)) + math.Abs(float64(neighbor.Y)-float64(toY)))
 			tentativeF := tentativeG + distance