This code is over 6 months old.
The code may have expired and might no longer function.
View original size
this is an algorithm for finding a path in overwatch (created in the similarity of A *) an algorithm for the best, optimal route between two points ( NQ16W - this is a simple example of creating bots, where the end point of the position of the bots and a map of the path are indicated )
thanks for this alg, it's amazing. i wonder if its possible to avoid the bots from falling too low, because now all nodes are nwp but between nodes they may fall.
6 Comments
thanks for this alg, it's amazing. i wonder if its possible to avoid the bots from falling too low, because now all nodes are nwp but between nodes they may fall.
dope.
does this work with multiple dummies? It's not too far from my solution in Type Echo so i'd like to look into incorporating it
NQ16W - this is a simple example of creating bots, where the end point of the position of the bots and a map of the path are indicated
yes you can use it for multiple dummies, but then you need to change the count of operations
Very nice
Thank you