Roland_Yonaba wrote:...did you just implemented a classical A* ?
How do you manage insertion/deletion in your openlist/closedlist collections ? With table.insert/table.remove ? Are they fast enough ?
Yes, classical A*.
I made 'priority queue' module for 'openlist' and 'list' module for 'closedlist'. Speed: 300 nodes(grid), find path from node1 to node300 without obstacles: 0.0013 milliseconds.
AntonioModer wrote:
Yes, classical A*.
I made 'priority queue' module for 'openlist' and 'list' module for 'closedlist'. Speed: 300 nodes(grid), find path from node1 to node300 without obstacles: 0.0013 milliseconds.
Nice.
For what it's worth, you might want to have a look at my Jumper.
@litearc any chance of seeing a screen with nearest neighbour filtering? The pixels look pretty.
Do you recognise when the world won't stop for you? Or when the days don't care what you've got to do? When the weight's too tough to lift up, what do you? Don't let them choose for you, that's on you.
