Wall checking between two points

[Chompy]

PHP Code:

function checkPath(ox, tx, oy, ty) {
  temp.nxy = {(tx + 23.5/16) - (ox + 23.5/16)
              (ty + 31.5/16) - (oy + 31.5/16)};
  temp.dist = (nxy[0]*nxy[0] + nxy[1]*nxy[1])^0.5;
  temp.ow = false;
  
  for(temp.i = 0; i < dist; i ++) {
    if (onwall2((ox + 23.5/16) + ((nxy[0]/dist) * i),
       (oy + 31.5/16) + ((nxy[1]/dist) * i), 0.5, 0.5)) {
      ow = true;
      break;
    }
    i ++;
  }
  return ow;
} 


wee

[Inverness]

Originally Posted by Twinny

I set up nodes all over my gmaps while using dynamic a* to navigate between nodes. I figured that using a* for a whole gmap would quickly set fire to the NPC-Server .

Perhaps a system could be created to transfer complex calculations to a single client that has the NPC loaded and the calculating client would shift between the various clients that have it loaded, and fall back on the NPC-Server if none have it loaded.

Just a thought.

[Rapidwolve24]

I know I'm a little late but wouldnt something like this do the trick

PHP Code:

public function CheckPath(x, y, dx, dy)
{   
   temp.check = 0;
   temp.checkrate = 1;
   
   temp.distance = distance(x, y, dx, dy);
   temp.angle = getangle(dx - x, dy - y);
   
   while (temp.check < temp.distance)
   {
     temp.checkx = int(x + (temp.check * cos(temp.angle)));
     temp.checky = int(y + (temp.check * -sin(temp.angle)));
     
     if (onwall(temp.checkx, temp.checky))
     {
        temp.onwallcounter += 1;
     }
   
     temp.check += temp.checkrate;
     
     sleep(0.05);
   } 
  return temp.onwallcounter;
}