1 PROGRAM KNIGHTSTOUR(OUTPUT);
7 A,B: ARRAY[1..8] OF INTEGER;
8 H: ARRAY[1..N,1..N] OF INTEGER;
10 PROCEDURE TRY(I: INTEGER; X,Y: INTEGER; VAR Q: BOOLEAN);
11 VAR K,U,V: INTEGER; Q1: BOOLEAN;
13 REPEAT K:= K+1; Q1 := FALSE;
14 U := X + A[K]; V := Y + B[K];
15 IF (1<=U) AND (U<=N) AND (1<=V) AND (V<=N) THEN
19 BEGIN TRY(I+1,U,V,Q1);
20 IF NOT Q1 THEN H[U,V] := 0
30 A[3] := -1; B[3] := 2;
31 A[4] := -2; B[4] := 1;
32 A[5] := -2; B[5] := -1;
33 A[6] := -1; B[6] := -2;
34 A[7] := 1; B[7] := -2;
35 A[8] := 1; B[8] := -1;
38 FOR J := 1 TO N DO H[I,J] := 0;
39 H[1,1] := 1; TRY(2,1,1,Q);
42 BEGIN FOR J := 1 TO N DO WRITE( H[I,J] :5);
45 ELSE WRITELN("KEINE LOESUNG!")