|
@ -21,8 +21,23 @@ int sucheXWert(int realU[N][N]){ |
|
|
|
|
|
|
|
|
} |
|
|
} |
|
|
} |
|
|
} |
|
|
return i; |
|
|
|
|
|
} |
|
|
} |
|
|
|
|
|
return ii; |
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
int sucheYWert(int realU[N][N]){ |
|
|
|
|
|
int groesste = 0; |
|
|
|
|
|
int jj; |
|
|
|
|
|
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]; |
|
|
|
|
|
jj = j; |
|
|
|
|
|
|
|
|
|
|
|
} |
|
|
|
|
|
} |
|
|
|
|
|
} |
|
|
|
|
|
return jj; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
int win(int realU[N][N]){ |
|
|
int win(int realU[N][N]){ |
|
|