Sorry your browser is not supported!

I have a problem that someone here may have already solved.

I wish to return the number of an object that is the closest to my 'player object'. I do not wish to use a list of object positions to solve this as there may be thousands of objects interacting but if someone uses this method effectively I would like to see how it is done.

My attempt does not work that well. It effectivly creates an invisible sphere that grows around the 'player' until it hits an object. An execution of the code will demonstrate it's poor quaility.



With this method I wish to build an environment that reacts to the players world relationship without the need to predefine action points. It might also be used to have agents interact with each other.
If anyone knows of a better way to solve this I would like to see how to do it properly.

This is what i use...hope it helps
ckeckdistance:
for obj=firstobj to lastobj
diffx#=abs(object position x(player)-object position x(obj))
diffz#=abs(object position z(player)-object position z(obj))
distance#=sqrt((diffx#*diffx#)+(diffz#*diffz#))
if distance#<30 then closest=obj:return
next obj
return

Correct...Just a little modification:



This will go through the objects and find the closest one, no matter how close it is. The "closest" variable that is returned will be the object number of the closest object. This code uses all three dimensions, like a sphere. The abs() functions are not needed because when you square a number it always ends up positive.

Good Luck