public int findFarthest(){
        int index=-1;
        for(int q=0;q<objects.size();q++) {
            if (objects.get(q) == this||objects.get(q).kind==kind||objects.get(q).kind==0)
                continue;
            int searchRadius = 400; //radius of whether the object will be findable
            boolean search = collisionCircle(getX(),getY(),searchRadius,objects.get(q).getX(),objects.get(q).getY(),20); // whether the object is close enough to be considered
            boolean facing = isFacing(q,45); //whether it's facing the object
            if(search&&facing) {
                if(index==-1)
                    index=q;
                int distance1 = (int)Math.sqrt(Math.pow(x-objects.get(q).x,2)+Math.pow(y-objects.get(q).y,2));//challenger for farthest distance distance...
                int distance2 = ((int)Math.sqrt(Math.pow(x-objects.get(index).x,2)+Math.pow(y-objects.get(index).y,2))); //current farthest distance

                if(distance1>distance2)
                    index=q;

            }
        }
        return index;
    }