Hi everyone,
I have a bit of a noob question. I’m making a mobile grid game and one of it’s features is to find the shortest path from the start destination to the end destination, while going though all the point objects. There are no obstacles.
How do you use the Jumper Library to calculate the shortest path to visit all the point objects? I was looking at the example and they only had one with obstacles, which can be seen in the table below (the 1’s are obstacles).
local map = {
{0,1,0,1,0},
{0,1,0,1,0},
{0,1,1,1,0},
{0,0,0,0,0},
}
Thanks so much for your help!