Function AIFindRandomRoom

Descent3/AImain.cpp:3503–3587

int AIGoalGotoRandomRoom() { return -1; }

int AIFindRandomRoom(object *obj, ai_frame *ai_info, goal *goal_ptr, int avoid_room, int min_depth, int max_depth,
                     bool f_check_path, bool f_cur_room_ok, int *depth) {
  int random_room = obj->roomnum;
  int n_tries = 0;
  bool valid = false;
  bool f_use_depth = false;
  int cur_depth;
  int cur_room = obj->roomnum;
  int mine_rooms[MAX_ROOMS];
  int num_mine_rooms = 0;
  int cur_mine = MINE_INDEX(obj->roomnum);
  int i;

  for (i = 0; i <= Highest_room_index; i++) {
    if (Rooms[i].used && !(Rooms[i].flags & RF_EXTERNAL) && cur_mine == MINE_INDEX(i)) {
      mine_rooms[num_mine_rooms++] = i;
      ASSERT(Rooms[mine_rooms[num_mine_rooms - 1]].used);
    }
  }

  if (max_depth >= 0 && min_depth >= 0) {
    f_use_depth = true;
    cur_depth = min_depth + (float)ps_rand() / (float)D3_RAND_MAX * (max_depth - min_depth);
  }

  do {
    random_room = mine_rooms[ps_rand() % num_mine_rooms];
    valid = true;

    if (random_room == avoid_room || ((!f_cur_room_ok) && (random_room == obj->roomnum)) || (!Rooms[random_room].used))
      valid = false;

    if (valid && f_check_path) {
      ASSERT(Rooms[random_room].used);
      ASSERT(Rooms[obj->roomnum].used);
      valid = AIPathAllocPath(obj, ai_info, goal_ptr, &obj->roomnum, &obj->pos, &random_room,
                              &Rooms[random_room].path_pnt, 0.0f, 0, obj->handle);
    }

    n_tries++;
  } while (!valid && n_tries <= FRR_MAX_TRIES && num_mine_rooms > 1);

  if (valid && f_use_depth) {
    while (cur_room != random_room && cur_depth > 0) {
      cur_room = BOA_NEXT_ROOM(cur_room, random_room);
      cur_depth--;
    }

    random_room = cur_room;
  }

  if (!valid) {
    int next_rooms[100];
    int i;
    int pick_list[100];
    int num_pickable = 0;

    int num_next_rooms = AIMakeNextRoomList(obj->roomnum, next_rooms, 100);