static double[] moveProbs(int k, double[] capacity, double[][][] graph) {
		double[] taueta = new double[NUM_AGENTS]; 
		double sum = 0.0; // sum of all tauetas
		for (int i = 0; i < taueta.length; ++i) { // i is the agent in question
			if (capacity[i] <= graph[i][k][1]) {
				taueta[i] = 0.0; // prob of moving to an agent that can't handle the task is 0
			} else {
				taueta[i] = Math.pow(graph[i][k][2], ALPHA) * Math.pow((1.0 / graph[i][k][0]), BETA); 
				// ^ could be huge when pheromone is big; now we come back to these upper and lower bounds
				if (taueta[i] < TAUETA_LOWER_BOUND)
					taueta[i] = TAUETA_LOWER_BOUND;
				else if (taueta[i] > TAUETA_UPPER_BOUND) 
					taueta[i] = TAUETA_UPPER_BOUND;
			}
			sum += taueta[i];
		}
		double[] probs = new double[NUM_AGENTS];
		for (int i = 0; i < probs.length; i++)
			if (sum > 0) probs[i] = taueta[i] / sum; // big trouble if sum = 0.0
			else probs[i] = 0;
		return probs;
	}