N", \ INPUT J \ PRINT 
4025 IF J>=I THEN 4020
4030 M(I)=M(I)-1 \ M(J)=M(J)+1
4499 RETURN
5000 REM *** COMPUTER WAEHLT GEMAESS STRATEGIE ***
5010 L=0
5020 FOR I=7 TO 0 STEP -1
5030 IF M(I)=0 THEN 5090
5040 FOR J=M(I) TO 1 STEP -1
5050 Y=I \ X8=L \ B(L)=I
5060 GOSUB 6000 \ REM *VERSCHLUESSELN ZAHL I IN A(L,J) - J=0,1,2*
5070 L=L+1
5080 NEXT J
5090 NEXT I
5100 IF G1=0 THEN 5200
5110 GOSUB 6500 \ IF G=1 THEN G1=0 \ GO TO 5200
5120 FOR I=7 TO 0 STEP -1
5130 IF M(I)=0 THEN 5150
5140 Z1=I \ Z2=INT(I*RND(0)) \ GO TO 5300
5150 NEXT I
5200 FOR I=0 TO 2
5210 FOR J=0 TO 2 \ A(4,J)=A(I,J) \ NEXT J
5220 FOR Z2=B(I)-1 TO 0 STEP -1
5230 X8=I \ Y=Z2 \ GOSUB 6000 \ GOSUB 6500 \ IF G=0 THEN 5270
5240 NEXT Z2
5250 FOR J=0 TO 2 \ A(I,J)=A(4,J) \ NEXT J
5260 NEXT I
5270 Z1=B(I)
5300 PRINT "COMPUTER ZIEHT VON FELD "Z1"NACH"Z2 \ PRINT 
5320 M(Z1)=M(Z1)-1 \ M(Z2)=M(Z2)+1
5999 RETURN
6000 REM *** VERSCHLUESSELN FELD Y NACH A(X8,X9) - X9=0,1,2 ***
6005 X9=0
6010 FOR K1=2 TO 0 STEP -1
6020 X=Y
6030 X=X/2^K1
6040 IF INT(X)=0 THEN A(X8,X9)=0 \ GO TO 6060
6050 Y=Y-2^K1 \ A(X8,X9)=1
6060 X9=X9+1 \ NEXT K1
6499 RETURN
6500 REM *** KONSTELLATION: G=1 - UNGERADE, G=0 - GERADE ***
6510 FOR K1=0 TO 2
6520 A(3,K1)=0
6530 FOR K2=0 TO 2
6540 A(3,K1)=A(3,K1)+A(K2,K1)
6550 NEXT K2
6560 IF A(3,K1)<>0 THEN IF A(3,K1)<>2 THEN G=1 \ GO TO 6999
6570 NEXT K1 \ G=0
6999 RETURN
9999 END