return pNum(nodes.size(), numTiles) + numTiles * n + t;
return pNum(nodes.size()-1, numTiles) + numTiles * n + t;
    private int dNum(int n, int t) {	return pNum(nodes.size(), numTiles) + numTiles * n + t;    }