Duath
Duath
PostsComments
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
"return walkable = false;" will assign false to walkable and then return false always 😛
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
no prob
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
should do the job
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
no boxing issues i think 😛
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
its actually quite fast as well
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
casting int to double looses data, so it would not work anyway
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
HashCode.Combine<double, double> as well
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
you are the captain now 😄
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
yes you have the power here 😛
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
i should have done it
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
where dicts key is ourt calss so you dont have to 😛
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
and in dictionery's key
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
bouth in mytupel
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
as types
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
in this case just use double
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
it a waste of tie and memory 😛
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
no dont cast it
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
mybad 😛
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
wherever i use int
137 replies
CC#
Created by Cam on 1/30/2024 in #help
✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)
change it to double of course
137 replies