Hey guys,
I'm currently developing a pong clone in C++ with SDL, but I'm having some problems with collisions at higher velocity levels.
When looking for collisions, I check the current sprite's new position against all other sprites' positions and if their positions are within each other, I restore the old position and call a function that handles collision cases.
While this method works superb with lower velocity levels, it doesn't work that well when a sprite moves at a higher rate because it can "jump past" another sprite and avoid collision.
I've tried to sketch some scenarios to make it a little clearer.
My highly theoretical "solution" is to simulate the new movement position into small bits and if neither of these collide, I'll assume the sprite's new position won't overstep another.
Horrible example code to explain my thoughs:
//Our new sprite pos is [23,7] relative to our last pos ([x,y])
//Roughly 3 times x for each y
for(int i = 0; i < 7; i++)
{
theSprite->MoveRelativePos(3, 1);
for(int j = 0; j < game->sprites->size(); j++)
{
// Check if the sprite's new relative position collides with any other sprite, don't check against itself
if(theSprite != sprites[j] && theSprite->CheckCollision(sprites[j]))
return true; // Collision detected
}
}
return false; // No collision detected
I think this method would be a really ugly and a tremdeous slow way of checking collisions. I could probably get away with it in Pong, but I can only imagine the horror of 30+ sprites...
Does any of you have a better way of doing this?
Edit:
I'm also wondering if 35-40 miliseconds on average for a gamecycle is much in a game like pong? It sounds like a lot..
