It acts as an array. No need to store it in an array, because it is using a 'seed'. Any time you use the same seed the expression noisejs.perlin2(X, Y) returns the same random value for the same X/Y.

Try to make/handle an array with a dimensions (100.000,100.000,1), and you will understand why not to bring it into an array.

noisejs.perlin2(100.000, 100.000) has no problem to calculate that value without storing this value (and all other 10000000000 values) in a memory eating array.

But if you insist to do so. This is the example in the first post in this topic + 1 line more code.

https://www.dropbox.com/s/76vyk7glzataj ... .capx?dl=0

https://www.dropbox.com/s/d96xrgfceia13 ... .capx?dl=0

Did you stop the path movement ?

Besides that. Just use the action 'set speed'.

Should work if you use 'nearest' as target mode.

If First in range, the turret will always track the same target until it leaves range, even if other targets come in range. If Nearest, the turret may switch to a different target before its current target leaves range, if another target comes closer.

https://www.dropbox.com/s/cwenrp36rxe2o ... .capx?dl=0

You can use the family only to sort Z order.

If there are many many objects, but the order can be constraint to ordering around a few 'key' objects, you can pre-pick those objects.

Example with order needed only around the player. (player is also in the family)

Give player the Line of Sight behaviour with a reasonable range.

Give the family a family instance variable 'ground'.

(Player) Has LOS on (family)

____For each (family)

_________Set family.ground to family.y

____Empty event

_________System > Sort Z order > Object = family ... Instance variable = 'ground'.

You can also pre-pick those that are on screen

Is on screen (family)

____For each (family)

_________Set family.ground to family.y

____Empty event

_________System > Sort Z order > Object = family ... Instance variable = 'ground'.

Since ....

1/ C2 is marketed as "You can now make advanced games without writing a line of code. Construct 2 does the hard work so you don't have to."

2/ I belong to the targeted category of 'scripters'.

3/ I can only trust (because of point 1) that i can never ever reach the performance of the build in Array sort algorithm. And (because of point 2) i am not supposed to have the knowledge to beat that performance.

....... i use this lazy method. Basically it comes down to reserving the X-axis for sorting by self-made 'filters', and store every value on the Y-axis.

https://www.dropbox.com/s/brvmx9pupif37 ... .capx?dl=0

goto Array.at( floor( random(0,Array.width) ) )

Also, this works when there are just no instances of 'object'. Your rules apply also in that situation. But you can not compare non existing objects. You would not catch that exception.

https://www.dropbox.com/s/wvobrac95gmao ... .capx?dl=0

https://www.dropbox.com/s/03p791s45x1t5 ... .capx?dl=0

or

https://www.dropbox.com/s/dgxl0c9llxliq ... .capx?dl=0

Object > Compare instance variable > var .. Equal to .. 4 <--- picks all instances of Object with var= 4

________(no actions)

Else <--- when that previous picklist is empty, parent condition is untrue, so the else runs

_____Create Object somewhere

_____set var to 4

UberLou

It is just how it works. C2 is mostly about picking.