|
@ -88,17 +88,10 @@ int lose(int realU[N][N], char richtung){ |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
int update(int realU[N][N],char richtung) { |
|
|
int update(int realU[N][N],char richtung) { |
|
|
int groesste = 0; |
|
|
|
|
|
int ii, jj; |
|
|
|
|
|
for(int i = 0; i < N; i++) { |
|
|
|
|
|
for(int j = 0; j < N; j++) { |
|
|
|
|
|
if(realU[N][N] > groesste && realU[N][N] != (N * N) + 1) { |
|
|
|
|
|
groesste = realU[i][j]; |
|
|
|
|
|
ii = i; |
|
|
|
|
|
jj = j; |
|
|
|
|
|
} |
|
|
|
|
|
} |
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int ii = sucheXWert(realU); |
|
|
|
|
|
int jj = sucheYWert(realU); |
|
|
|
|
|
|
|
|
if(richtung == 'u') { |
|
|
if(richtung == 'u') { |
|
|
if(ii == 0) { |
|
|
if(ii == 0) { |
|
|
return 1; |
|
|
return 1; |
|
|