public double[] prob(int[] ps, int pos) {
		double[] p = new double[4];
		double[] scores = new double[3];
		for (int i = 0; i < windowsize; i++) {
			// abfangen von as gleich x
			if (ps[pos + i - whalf] < 20) {
				scores[0] += matrix[0][ps[pos + i - whalf]][i];
				scores[1] += matrix[1][ps[pos + i - whalf]][i];
				scores[2] += matrix[2][ps[pos + i - whalf]][i];
			}
		}
		p[0] = (Math.exp(scores[0]) / (1.0 + Math.exp(scores[0])));
		p[1] = (Math.exp(scores[1]) / (1.0 + Math.exp(scores[1])));
		p[2] = (Math.exp(scores[2]) / (1.0 + Math.exp(scores[2])));
		if (p[0] > p[1] && p[0] > p[2])
			p[3] = 0;
		else if (p[1] > p[0] && p[1] > p[2])
			p[3] = 1;
		else if (p[2] > p[0] && p[2] > p[1])
			p[3] = 2;
		else
			p[3] = 3;
		return p;
	}