koobas.hobune.stream
Grid based movement collision detection
I have a bit of a problem with my movement and I am not sure it is solvable at all...
I have player and enemies moving on a grid and I want them to not move into each other. I can't use physical colliders, since they then would stop somewhere and not on distinct grid points. I can't use raycasting, since they all move at the same time, so when there is a empty tile between two objects and they both want to go there, raycasting would allow it. I have tried using an array to set specific tiles invalid when occupied, but that somehow doesn't work during runtime (probably because I coded it wrongly) and suffers the same problem as raycasting anyway.
Anyone here has an idea, or am I screwed?
Well, you could do it in a two-pass way- every object sets the tile it wants to move to as 'occupied', and then the engine checks for whether any given object is allowed to move, given the one-step-forward occupation status! Just out of interest, if two objects want to move to the same grid location, how does it deter$$anonymous$$e which one gets to go first? I don't quite understand how this works, given that they 'all move at the same time'.
Although they move at the same time, I doubt the engine calculates it at the same time for both objects, so whoever is calculated first, has priority, with the player having priority over all enemies.
How would I do this? Store all destinations in an array and then compare each to every subsequent one and recalculate (or stop) the ones that are the same? Wouldn't that take quite some time to calculate?
Thanks for co$$anonymous$$g our timberland online store! Just enjoy yourself here! As a developping company, timberland boots always can give us some surprise .I belive timberland shoes Sale can make your feet more comfortable, make your life more stylish!If you want to have a try ,just click here: discount timberland boots Free delivery
Don't bother with physics and raycasting and so on, just use a 2D array that represents the game world. Check the array for what it contains, and do collision based on that.
I got it. I guess this answer is quite close to what I did, although I had the idea yesterday before I went to bed, after reading syclamoth's comment and thinking some more, so I'll accept it...
$$anonymous$$aybe it helps others, so I'll write the complete solution here:
I first created a unique ID for every actor in the scene, by creating a static variable in a global script, writing that into the uniqueId variable in the enemies' script and increasing the static variable by one (function Start()). The Player has ID 0.
Secondly I created a static array in the same global script and store the grid based position (not the XYZ position) in that array at posArray[uniqueId]. The destination is tested against this array in a for loop and if the same grid point is already in there, the actor doesn't move. Then posArray[uniqueId] is overwritten with the new location.
On death posArray[uniqueId] is freed up again.
Thanks to both of you.
I would highly recommend using a 2D array like I mentioned ins$$anonymous$$d, that way you can directly look up whether a cell is occupied using the grid x/y coords in a single statement, rather than using a for loop.
I tried that earlier, it was the first ting I tried, and multiple times, but it never worked. I had a 2D array that I filled with boolean values and if a tile was occupied I set the corresponding entry to false, but it was extremely slow during runtime and also not very reliable (probably because I did it wrongly).
There's no reason for it to be slow or unreliable, so I'd recommend fixing that code. It would be much faster than using a for loop.
I guess the problem was that two or more objects wanted to write in the same entry at the same time, or some such, but I can try again...
