#How to calculate the shortest path, fastest in A*?
1 messages · Page 1 of 1 (latest)
@upper flower is most knowledgeable regarding A* in rec room so ill let him answer this
1 messages · Page 1 of 1 (latest)
I created an AI with the A star algorithm, using Euclidean distance, what I want to know is, how can I calculate the path faster. (I use a custom 'For' chip, I think this could be the problem, I'll try to calculate how long it takes to perform 64 interactions)
64 interactions was calculated in 2.762675s, I think this is not a problem
@upper flower is most knowledgeable regarding A* in rec room so ill let him answer this