action path_setEnemy()
{
   proc_kill2(path_setEnemy,my);
   VECTOR vec_next_node;

   VECTOR temp;
	
   path_set(my,"path_001");

   while(1)
   {
      // PATH NODE DETECTION AND FACING ///////////////

      if(vec_dist(my.x,vec_next_node.x) < 80) 
      {    
         if(pathSetNum_enemy == 1) // enemy runs down stairs
	 {
	    my.NODE_NEXT+=1; 
	 }
		 
	 if(pathSetNum_enemy == 2) // enemy runs up stairs
         {
            my.NODE_NEXT-=1; 
	 }
	         
	 if(my.NODE_NEXT > 247) // node 247 = top of stairs 
                                //    node
	 {
	    my.NODE_NEXT = 247;	
         }
		    	
         if(my.NODE_NEXT < 1) // node 1 = bottom of stairs node
	 {
	    my.NODE_NEXT = 1;	
         }
      }
		
      path_getnode(my,my.NODE_NEXT,vec_next_node,NULL); 
         // gets the next node 
     
      vec_to_angle(my.pan,vec_diff(NULL,vec_next_node.x,my.x));
         // face the new node
		
      wait(1);
   }
}

path_getnode(my,my.NODE_NEXT,vec_next_node,NULL);

// find closest node
// using  -> // node 247 = top of stairs 
int i=0;
var node_closest_dist= 99999; /// Very high start number
int close_node_winner=0; //
VECTOR vec_temp_node;

// checking all node distances 
for(i=0;i<247;i++)
{
   path_getnode(my,i+1,vec_temp_node,NULL);
   if(vec_dist(my.x,vec_temp_node)< node_closest_dist)
   {
     node_closest_dist=vec_dist(my.x,vec_temp_node);
     close_node_winner = i+1;
   }
}
// After checking - assign winner and reset values
my.NODE_NEXT = close_node_winner;
close_node_winner =0;
node_closest_dist = 999999;