public int[] findPosForNewPlayer() {
        //TODO make sure to handle when the map is full and there is no space for new players
        // maybe place then on a waiting queue but will still need to listen for other players because this will pause.
        System.out.println("Finding a place for a new player...");
        int loc[] = new int[2];
        boolean done = false;
        do {
            int xrand = (int) (Math.random() * width);
            int yrand = (int) (Math.random() * height);
            if (isCellPath(xrand, yrand) && !isCellHavePawnOn(xrand, yrand)) {
                loc[0] = xrand;
                loc[1] = yrand;
                done = true;
            }
        } while (!done);
        return loc;
    }