stevanooz

I am new to this forum... and just learned the GML... just a couple days ago I thought to create a pacman game... but.. an action pacman game... and your solution is good and simple... I just add some more code to create the action style. I want the pacman now can shoot a fire/batarang, create supersonic wave/retractable chain.. is limited of course...

thanks for this simple but great tutorial...

no one can help me here ? or my question is too basic to answer ?
hemm.. I hope someone answer this....

The example code already does it (as mentioned at the 14th line.) Each of 'lower' teleporters (I suppose it means that the y coordinates is smaller than the current one) is assigned 'dist' according to the distance. On the other hand, 'higher' ones get the value of distance + 10000. As the result, every 'lower' instance has smaller value of dist than 'higher' ones. We choose the one who has the smallest dist among all of them.

If there is any 'lower' instance that matches criteria, the closest one among them is picked up. When there is no 'lower' one, the closest one is found from 'higher' ones.

ouhh.. i c....
well.. i guess, I must try any of the suggestion here to more understand.

thank you all...

Instead of checking every places, you can loop through instances of the object. Supposing that it is in the collision event with a teleporter:

var current, found, dist, min_dist; // Declare variables so that we can access them within the with-loop.
current = other.id; // Save the id of the teleporter we hit so that we can refer it inside the loop.
found = noone;
min_dist = 99999; // Give it large enough initial value.

with (obj_teleporter) { // Loop through all instances of the teleporter object.
    // Skip instances those don't match our criteria
    if (id == current) continue; // It is the same teleporter we hit.
    if (collision_line(x, y, current.x, current.y, obj_block, false, true)) continue; // It is blocked

    // Now check if it is the closest one
    dist = distance_to_object(current);
    if (y >= current.y) {
        dist += 10000; // Make that 'higher' instances are found after lower ones.
    }
    if (dist < min_dist) {
        dist = min_dist;
        found = id;
    }
}

// Now 'found' contains the id of the closest instance, or noone if all instances are blocked.

hemm.. it's a good one...
but... how can it chek the lower first and then the highest... as I said before... it will search the lower teleport first, if can't find one... then it will start search from the highest one. assume my room is 1024x1024... so it will first search teleport lower from the current teleport, until it find one. if not and reach (0,0).. then it will start search again from 1024x1024 until it find one. It must be find it somehow, because my game is not create the teleport without any destination. at least 2 teleports in one room.

so... we still have to check it one by one, right ??...
i guess there is no short way to find it... haha... I mean maybe there is a function to use that can check and pick one out....

but your program is simple... and I wasn't thinking that... I mean, I never thought to use another pixel to check every position...

thanks a lot man... I will try it out... i believe it will work. I hope the checking won't take too long, so it can freeze the program...