|
@ -10,6 +10,21 @@ |
|
|
|
|
|
|
|
|
int speed = 0; |
|
|
int speed = 0; |
|
|
|
|
|
|
|
|
|
|
|
int sucheXWert(int realU[N][N]){ |
|
|
|
|
|
int groesste = 0; |
|
|
|
|
|
int ii; |
|
|
|
|
|
for(int i = 0; i < N ; i++){ |
|
|
|
|
|
for(int j = 0; j < N; j++){ |
|
|
|
|
|
if (realU[i][j] > groesste && realU[i][j] != (N * N) + 1){ |
|
|
|
|
|
groesste = realU[i][j]; |
|
|
|
|
|
ii = i; |
|
|
|
|
|
|
|
|
|
|
|
} |
|
|
|
|
|
} |
|
|
|
|
|
return i; |
|
|
|
|
|
} |
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
int win(int realU[N][N]){ |
|
|
int win(int realU[N][N]){ |
|
|
int groesste = 0; |
|
|
int groesste = 0; |
|
|
for(int i = 0; i < N; i++){ |
|
|
for(int i = 0; i < N; i++){ |
|
|