kts/gridpathingtest
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Use cell hueristic for tentative g

Browse Source
This commit is contained in:
Ketchetwahmeegwun T. Southall 2024-02-03 00:51:41 -08:00
parent a9fba17943
commit 182214c6d0
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sauce/astar.go
View File

@ -64,7 +64,7 @@ func FindPath(w *World, fromX, fromY int, toX, toY int) ([]Node, bool) {
// Iterate over neighbors. // Iterate over neighbors.
for _, neighbor := range 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))) distance := int(math.Abs(float64(neighbor.X)-float64(toX)) + math.Abs(float64(neighbor.Y)-float64(toY)))
tentativeF := tentativeG + distance tentativeF := tentativeG + distance