Home Esplora Aiuto
Accedi
enikesha
/
old
1
0
Forka 0
File Problemi 0 Pull Requests 0 Wiki
Ramo (Branch): master
Rami (Branch) Tag
old
/
PAS
/
XO
/
GRISHA.INC

GRISHA.INC 30 KB
Permalink Cronologia Originale

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440 
  1. Procedure Gor(Var cx,x,y,prior : byte);Far;
    2. 

  2.  Var
    3. 

  3.     i,j,left,Rigth,Proz,Sum: byte;
    4. 

  4.   Begin
    5. 

  5.     For j:=1 to n do
    6. 

  6.       Begin
    7. 

  7.         For i:=4 to n-1 do
    8. 

  8.           Begin
    9. 

  9.             Rigth:=Pole[i+1,j];Left:=pole[i-3,j];
    10. 

  10.             Sum:=pole[i,j]+pole[i-1,j]+pole[i-2,j];
    11. 

  11.             Proz:=pole[i,j]*pole[i-1,j]*pole[i-2,j];
    12. 

  12.             If(left=0)and(rigth=0)and(sum=3)and(proz=1)and(prior<>5)then Begin x:=i+1;y:=j;prior:=5;End;
    13. 

  13.             IF(left=0)and(rigth=0)and(sum=6)and(proz=8)and(prior<>5)then Begin x:=i+1;y:=j;prior:=5;End;
    14. 

  14.             IF(left=2)and(rigth=0)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i+1;y:=j;prior:=5;end;
    15. 

  15.             IF(left=0)and(rigth=2)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i-3;y:=j;prior:=5;end;
    16. 

  16.             IF(left=1)and(rigth=0)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i+1;y:=j;prior:=5;end;
    17. 

  17.             IF(left=0)and(rigth=1)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i-3;y:=j;prior:=5;end;
    18. 

  18.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    19. 

  19.             (pole[i,j]=1)and(pole[i-2,j]=1)and(prior<>5)then Begin x:=i-1;y:=j;prior:=5;end;
    20. 

  20.             If(left=0)and(rigth=1)and(sum=2)and(proz=0)and
    21. 

  21.             (pole[i,j]=1)and(pole[i-2,j]=1)and(prior<>5)then Begin x:=i-1;y:=j;prior:=5;end;
    22. 

  22.             If(left=1)and(rigth=0)and(sum=2)and(proz=0)and
    23. 

  23.             (pole[i,j]=1)and(pole[i-2,j]=1)and(prior<>5)then Begin x:=i-1;y:=j;prior:=5;end;
    24. 

  24.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    25. 

  25.             (pole[i,j]=2)and(pole[i-2,j]=2)and(prior<>5)then Begin x:=i-1;y:=j;prior:=5;end;
    26. 

  26.             If(left=0)and(rigth=2)and(sum=4)and(proz=0)and
    27. 

  27.             (pole[i,j]=2)and(pole[i-2,j]=2)and(prior<>5)then Begin x:=i-1;y:=j;prior:=5;end;
    28. 

  28.             If(left=2)and(rigth=0)and(sum=4)and(proz=0)and
    29. 

  29.             (pole[i,j]=2)and(pole[i-2,j]=2)and(prior<>5)then Begin x:=i-1;y:=j;prior:=5;end;
    30. 

  30.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    31. 

  31.             (pole[i-1,j]=2)and(pole[i-2,j]=2)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    32. 

  32.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    33. 

  33.             (pole[i-1,j]=1)and(pole[i-2,j]=1)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    34. 

  34.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    35. 

  35.             (pole[i-1,j]=2)and(pole[i,j]=2)and(prior<>5)then Begin x:=i-2;y:=j;prior:=5;end;
    36. 

  36.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    37. 

  37.             (pole[i-1,j]=1)and(pole[i,j]=1)and(prior<>5)then Begin x:=i-2;y:=j;prior:=5;end;
    38. 

  38.             If(left=1)and(rigth=0)and(sum=2)and(proz=0)and
    39. 

  39.             (pole[i-1,j]=1)and(pole[i,j]=1)and(prior<>5)then Begin x:=i-2;y:=j;prior:=5;end;
    40. 

  40.             If prior<>5 then Begin
    41. 

  41.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    42. 

  42.                                (pole[i,j]=1)and(pole[i-2,j]=1)and(cx=1)then Begin x:=i-1;y:=j;prior:=4;end;
    43. 

  43.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    44. 

  44.                                (pole[i,j]=2)and(pole[i-2,j]=2)and(cx=2)then Begin x:=i-1;y:=j;prior:=4;end;
    45. 

  45.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    46. 

  46.                                (pole[i-1,j]=2)and(pole[i-2,j]=2)and(cx=2)then Begin x:=i;y:=j;prior:=4;end;
    47. 

  47.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    48. 

  48.                                (pole[i-1,j]=1)and(pole[i-2,j]=1)and(cx=1)then Begin x:=i;y:=j;prior:=4;end;
    49. 

  49.                                If(left=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i-3;y:=j;prior:=4;End;
    50. 

  50.                                If(left=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i-3;y:=j;Prior:=4;End;
    51. 

  51.                                If(Rigth=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i;y:=j;prior:=4;End;
    52. 

  52.                                If(Rigth=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i;y:=j;Prior:=4;End;
    53. 

  53.                                If(left=0)and(pole[i-2,j]=0)and(pole[i,j]=0)and
    54. 

  54.                                (Rigth=0)And(Sum=1)And(cx=1)And(proz=0) Then Begin x:=i-1;y:=j;Prior:=4;End;
    55. 

  55.                                If(left=0)and(pole[i-2,j]=0)and(pole[i,j]=0)and
    56. 

  56.                                (Rigth=0)And(Sum=2)And(cx=2)And(proz=0) Then Begin x:=i-1;y:=j;Prior:=4;End;
    57. 

  57.                              End;
    58. 

  58.           End;
    59. 

  59.       End;
    60. 

  60.    If (x>=1)and(x<=n)and(y>=1)and(y<=n)and((pole[x,y])=0) Then
    61. 

  61.                                                              Else Begin
    62. 

  62.                                                              prior:=1;
    63. 

  63.                                                              x:=0;y:=0;
    64. 

  64.                                                              End;
    65. 

  65.   End;
    66. 

  66. Procedure Ver(Var cx,x,y,prior : byte);Far;
    67. 

  67.  Var
    68. 

  68.     i,j,left,Rigth,Proz,Sum: byte;
    69. 

  69.   Begin
    70. 

  70.     For i:=1 to n do
    71. 

  71.       Begin
    72. 

  72.         For j:=4 to n-1 do
    73. 

  73.           Begin
    74. 

  74.             Rigth:=pole[i,j+1];Left:=pole[i,j-3];
    75. 

  75.             Sum:=pole[i,j]+pole[i,j-1]+pole[i,j-2];
    76. 

  76.             Proz:=pole[i,j]*pole[i,j-1]*pole[i,j-2];
    77. 

  77.             If(left=0)and(rigth=0)and(sum=3)and(proz=1)and(prior<>5)then Begin x:=i;y:=j+1;prior:=5;End;
    78. 

  78.             IF(left=0)and(rigth=0)and(sum=6)and(proz=8)and(prior<>5)then Begin x:=i;y:=j+1;prior:=5;End;
    79. 

  79.             IF(left=2)and(rigth=0)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i;y:=j+1;prior:=5;end;
    80. 

  80.             IF(left=0)and(rigth=2)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i;y:=j-3;prior:=5;end;
    81. 

  81.             IF(left=1)and(rigth=0)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i;y:=j+1;prior:=5;end;
    82. 

  82.             IF(left=0)and(rigth=1)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i;y:=j-3;prior:=5;end;
    83. 

  83.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    84. 

  84.             (pole[i,j]=1)and(pole[i,j-2]=1)and(prior<>5)then Begin x:=i;y:=j-1;prior:=5;end;
    85. 

  85.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    86. 

  86.             (pole[i,j]=2)and(pole[i,j-2]=2)and(prior<>5)then Begin x:=i;y:=j-1;prior:=5;end;
    87. 

  87.             If(left=2)and(rigth=0)and(sum=4)and(proz=0)and
    88. 

  88.             (pole[i,j]=2)and(pole[i,j-2]=2)and(prior<>5)then Begin x:=i;y:=j-1;prior:=5;end;
    89. 

  89.             If(left=0)and(rigth=2)and(sum=4)and(proz=0)and
    90. 

  90.             (pole[i,j]=2)and(pole[i,j-2]=2)and(prior<>5)then Begin x:=i;y:=j-1;prior:=5;end;
    91. 

  91.             If(left=1)and(rigth=0)and(sum=2)and(proz=0)and
    92. 

  92.             (pole[i,j]=1)and(pole[i,j-2]=1)and(prior<>5)then Begin x:=i;y:=j-1;prior:=5;end;
    93. 

  93.             If(left=0)and(rigth=1)and(sum=2)and(proz=0)and
    94. 

  94.             (pole[i,j]=1)and(pole[i,j-2]=1)and(prior<>5)then Begin x:=i;y:=j-1;prior:=5;end;
    95. 

  95.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    96. 

  96.             (pole[i,j-1]=2)and(pole[i,j-2]=2)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    97. 

  97.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    98. 

  98.             (pole[i,j-1]=1)and(pole[i,j-2]=1)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    99. 

  99.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    100. 

  100.             (pole[i,j-1]=2)and(pole[i,j]=2)and(prior<>5)then Begin x:=i;y:=j-2;prior:=5;end;
    101. 

  101.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    102. 

  102.             (pole[i,j-1]=1)and(pole[i,j]=1)and(prior<>5)then Begin x:=i;y:=j-2;prior:=5;end;
    103. 

  103.             If prior<>5 then Begin
    104. 

  104.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    105. 

  105.                                (pole[i,j]=1)and(pole[i,j-2]=1)and(cx=1)then Begin x:=i;y:=j-1;prior:=4;end;
    106. 

  106.                                If(left=1)and(rigth=1)and(sum=1)and(proz=0)and
    107. 

  107.                                (pole[i,j-1]=1)and(cx=1)then Begin x:=i;y:=j;prior:=4;end;
    108. 

  108.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    109. 

  109.                                (pole[i,j-1]=1)and(pole[i,j-2]=1)and(cx=1)then Begin x:=i;y:=j;prior:=4;end;
    110. 

  110.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    111. 

  111.                                (pole[i,j-1]=2)and(pole[i,j-2]=2)and(cx=2)then Begin x:=i;y:=j;prior:=4;end;
    112. 

  112.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    113. 

  113.                                (pole[i,j]=1)and(pole[i,j-1]=1)and(cx=1)then Begin x:=i;y:=j-2;prior:=4;end;
    114. 

  114.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    115. 

  115.                                (pole[i,j]=2)and(pole[i,j-1]=2)and(cx=2)then Begin x:=i;y:=j-2;prior:=4;end;
    116. 

  116.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    117. 

  117.                                (pole[i,j]=2)and(pole[i,j-2]=2)and(cx=2)then Begin x:=i;y:=j-1;prior:=4;end;
    118. 

  118.                                If(left=2)and(rigth=2)and(sum=2)and(proz=0)and
    119. 

  119.                                (pole[i,j]=0)and(pole[i,j-2]=2)and(cx=1)then Begin x:=i;y:=j;prior:=4;end;
    120. 

  120.                                If(left=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i;y:=j-3;prior:=4;End;
    121. 

  121.                                If(left=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i;y:=j-3;Prior:=4;End;
    122. 

  122.                                   If(left=0)and(pole[i,j-2]=0)and(pole[i,j]=0)and
    123. 

  123.                                (Rigth=0)And(Sum=1)And(cx=1)And(proz=0) Then Begin x:=i;y:=j-2;Prior:=4;End;
    124. 

  124.                                   If(left=0)and(pole[i,j-2]=0)and(pole[i,j]=0)and
    125. 

  125.                                (Rigth=0)And(Sum=2)And(cx=2)And(proz=0) Then Begin x:=i;y:=j-2;Prior:=4;End;
    126. 

  126. 

  127.                              End;
    128. 

  128.           End;
    129. 

  129.       End;
    130. 

  130.    If (x>=1)and(x<=n)and(y>=1)and(y<=n)and((pole[x,y])=0) Then
    131. 

  131.                                                              Else Begin
    132. 

  132.                                                              prior:=1;
    133. 

  133.                                                              x:=0;y:=0;
    134. 

  134.                                                              End;
    135. 

  135. 

  136.   End;
    137. 

  137. Procedure Diag1(Var cx,x,y,prior : byte);Far;
    138. 

  138.  Var
    139. 

  139.     i,j,left,Rigth,Proz,Sum,t: byte;
    140. 

  140.   Begin
    141. 

  141.     For t:=5 to n do
    142. 

  142.      Begin
    143. 

  143.         i:=1;j:=t-2;
    144. 

  144.       While j>=2 do
    145. 

  145.           Begin
    146. 

  146.             Dec(j);Inc(i);
    147. 

  147.             Rigth:=pole[i+1,j-1];Left:=pole[i-3,j+3];
    148. 

  148.             Sum:=pole[i,j]+pole[i-1,j+1]+pole[i-2,j+2];
    149. 

  149.             Proz:=pole[i,j]*pole[i-1,j+1]*pole[i-2,j+2];
    150. 

  150.             If(left=0)and(rigth=0)and(sum=3)and(proz=1)and(prior<>5)then Begin x:=i+1;y:=j-1;prior:=5;End;
    151. 

  151.             IF(left=0)and(rigth=0)and(sum=6)and(proz=8)and(prior<>5)then Begin x:=i+1;y:=j-1;prior:=5;End;
    152. 

  152.             IF(left=2)and(rigth=0)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i+1;y:=j-1;prior:=5;end;
    153. 

  153.             IF(left=0)and(rigth=2)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i-3;y:=j+3;prior:=5;end;
    154. 

  154.             IF(left=1)and(rigth=0)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i+1;y:=j-1;prior:=5;end;
    155. 

  155.             IF(left=0)and(rigth=1)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i-3;y:=j+3;prior:=5;end;
    156. 

  156.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and(prior<>5)and
    157. 

  157.             (pole[i,j]=1)and(pole[i-2,j+2]=1)then Begin x:=i-1;y:=j+1;prior:=5;end;
    158. 

  158.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    159. 

  159.             (pole[i,j]=2)and(pole[i-2,j+2]=2)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    160. 

  160.             If(left=0)and(rigth=2)and(sum=4)and(proz=0)and
    161. 

  161.             (pole[i,j]=2)and(pole[i-2,j+2]=2)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    162. 

  162.             If(left=2)and(rigth=0)and(sum=4)and(proz=0)and
    163. 

  163.             (pole[i,j]=2)and(pole[i-2,j+2]=2)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    164. 

  164.             If(left=1)and(rigth=0)and(sum=2)and(proz=0)and
    165. 

  165.             (pole[i,j]=1)and(pole[i-2,j+2]=1)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    166. 

  166.             If(left=0)and(rigth=1)and(sum=2)and(proz=0)and
    167. 

  167.             (pole[i,j]=1)and(pole[i-2,j+2]=1)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    168. 

  168.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and(prior<>5)and
    169. 

  169.             (pole[i,j]=1)and(pole[i-1,j+1]=1)then Begin x:=i-2;y:=j+2;prior:=5;end;
    170. 

  170.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    171. 

  171.             (pole[i,j]=2)and(pole[i-1,j+1]=2)and(prior<>5)then Begin x:=i-2;y:=j+2;prior:=5;end;
    172. 

  172.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and(prior<>5)and
    173. 

  173.             (pole[i-1,j+1]=1)and(pole[i-2,j+2]=1)then Begin x:=i;y:=j;prior:=5;end;
    174. 

  174.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    175. 

  175.             (pole[i-2,j+2]=2)and(pole[i-1,j+1]=2)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    176. 

  176.             If prior<>5 then Begin
    177. 

  177.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    178. 

  178.                                (pole[i,j]=1)and(pole[i-2,j+2]=1)and(cx=1)then Begin x:=i-1;y:=j+1;prior:=4;end;
    179. 

  179.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    180. 

  180.                                (pole[i,j]=2)and(pole[i-2,j+2]=2)and(cx=2)then Begin x:=i-1;y:=j+1;prior:=4;end;
    181. 

  181.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    182. 

  182.                                (pole[i-1,j+1]=1)and(pole[i-2,j+2]=1)and(cx=1)then Begin x:=i;y:=j;prior:=4;end;
    183. 

  183.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    184. 

  184.                                (pole[i-1,j+1]=2)and(pole[i-2,j+2]=2)and(cx=2)then Begin x:=i;y:=j;prior:=4;end;
    185. 

  185.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    186. 

  186.                                (pole[i,j]=1)and(pole[i-1,j+1]=1)and(cx=1)then Begin x:=i-2;y:=j+2;prior:=4;end;
    187. 

  187.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    188. 

  188.                                (pole[i-1,j+1]=2)and(pole[i,j]=2)and(cx=2)then Begin x:=i-2;y:=j+2;prior:=4;end;
    189. 

  189.                                If(left=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i-3;y:=j+3;prior:=4;End;
    190. 

  190.                                If(left=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i-3;y:=j+3;Prior:=4;End;
    191. 

  191.                                If(Rigth=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i;y:=j;prior:=4;End;
    192. 

  192.                                If(Rigth=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i;y:=j;Prior:=4;End;
    193. 

  193.                                
    194. 

  194.                                    If(left=0)and(pole[i-2,j+2]=0)and(pole[i,j]=0)and
    195. 

  195.                                (Rigth=0)And(Sum=1)And(cx=1)And(proz=0) Then Begin x:=i-1;y:=j+1;Prior:=4;End;
    196. 

  196.                                    If(left=0)and(pole[i-2,j+2]=0)and(pole[i,j]=0)and
    197. 

  197.                                (Rigth=0)And(Sum=2)And(cx=2)And(proz=0) Then Begin x:=i-1;y:=j+1;Prior:=4;End;
    198. 

  198. 

  199.                              End;
    200. 

  200.       End;
    201. 

  201.      End;
    202. 

  202.    If (x>=1)and(x<=n)and(y>=1)and(y<=n)and((pole[x,y])=0) Then
    203. 

  203.                                                              Else Begin
    204. 

  204.                                                              prior:=1;
    205. 

  205.                                                              x:=0;y:=0;
    206. 

  206.                                                              End;
    207. 

  207.   End;
    208. 

  208. Procedure Diag2(Var cx,x,y,prior : byte);Far;
    209. 

  209.  Var
    210. 

  210.     i,j,left,Rigth,Proz,Sum,t: byte;
    211. 

  211.   Begin
    212. 

  212.     For t:=n downto 5 do
    213. 

  213.      Begin
    214. 

  214.         i:=t;j:=n;
    215. 

  215.       While j>=2 do
    216. 

  216.           Begin
    217. 

  217.             Dec(j);Inc(i);
    218. 

  218.             Rigth:=pole[i+1,j-1];Left:=pole[i-3,j+3];
    219. 

  219.             Sum:=pole[i,j]+pole[i-1,j+1]+pole[i-2,j+2];
    220. 

  220.             Proz:=pole[i,j]*pole[i-1,j+1]*pole[i-2,j+2];
    221. 

  221.             If(left=0)and(rigth=0)and(sum=3)and(proz=1)and(prior<>5)then Begin x:=i+1;y:=j-1;prior:=5;End;
    222. 

  222.             IF(left=0)and(rigth=0)and(sum=6)and(proz=8)and(prior<>5)then Begin x:=i+1;y:=j-1;prior:=5;End;
    223. 

  223.             IF(left=2)and(rigth=0)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i+1;y:=j-1;prior:=5;end;
    224. 

  224.             IF(left=0)and(rigth=2)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i-3;y:=j+3;prior:=5;end;
    225. 

  225.             IF(left=1)and(rigth=0)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i;y:=j;prior:=5;end;
    226. 

  226.             IF(left=0)and(rigth=1)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i-3;y:=j+3;prior:=5;end;
    227. 

  227.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    228. 

  228.             (pole[i,j]=1)and(pole[i-2,j+2]=1)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    229. 

  229.             If(left=0)and(rigth=1)and(sum=2)and(proz=0)and
    230. 

  230.             (pole[i,j]=1)and(pole[i-2,j+2]=1)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    231. 

  231.             If(left=1)and(rigth=0)and(sum=2)and(proz=0)and
    232. 

  232.             (pole[i,j]=1)and(pole[i-2,j+2]=1)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    233. 

  233.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    234. 

  234.             (pole[i,j]=2)and(pole[i-2,j+2]=2)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    235. 

  235.             If(left=0)and(rigth=2)and(sum=4)and(proz=0)and
    236. 

  236.             (pole[i,j]=2)and(pole[i-2,j+2]=2)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    237. 

  237.             If(left=2)and(rigth=0)and(sum=4)and(proz=0)and
    238. 

  238.             (pole[i,j]=2)and(pole[i-2,j+2]=2)and(prior<>5)then Begin x:=i-1;y:=j+1;prior:=5;end;
    239. 

  239.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and(prior<>5)and
    240. 

  240.             (pole[i,j]=1)and(pole[i-1,j+1]=1)then Begin x:=i-2;y:=j+2;prior:=5;end;
    241. 

  241.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    242. 

  242.             (pole[i,j]=2)and(pole[i-1,j+1]=2)and(prior<>5)then Begin x:=i-2;y:=j+2;prior:=5;end;
    243. 

  243.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and(prior<>5)and
    244. 

  244.             (pole[i-1,j+1]=1)and(pole[i-2,j+2]=1)then Begin x:=i;y:=j;prior:=5;end;
    245. 

  245.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    246. 

  246.             (pole[i-2,j+2]=2)and(pole[i-1,j+1]=2)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    247. 

  247.             If prior<>5 then Begin
    248. 

  248.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    249. 

  249.                                (pole[i,j]=1)and(pole[i-2,j+2]=1)and(cx=1)then Begin x:=i-1;y:=j+1;prior:=4;end;
    250. 

  250.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    251. 

  251.                                (pole[i,j]=2)and(pole[i-2,j+2]=2)and(cx=2)then Begin x:=i-1;y:=j+1;prior:=4;end;
    252. 

  252.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    253. 

  253.                                (pole[i-1,j+1]=1)and(pole[i-2,j+2]=1)and(cx=1)then Begin x:=i;y:=j;prior:=4;end;
    254. 

  254.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    255. 

  255.                                (pole[i-1,j+1]=2)and(pole[i-2,j+2]=2)and(cx=2)then Begin x:=i;y:=j;prior:=4;end;
    256. 

  256.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    257. 

  257.                                (pole[i,j]=1)and(pole[i-1,j+1]=1)and(cx=1)then Begin x:=i-2;y:=j+2;prior:=4;end;
    258. 

  258.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    259. 

  259.                                (pole[i-1,j+1]=2)and(pole[i,j]=2)and(cx=2)then Begin x:=i-2;y:=j+2;prior:=4;end;
    260. 

  260.                                If(left=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i-3;y:=j+3;prior:=4;End;
    261. 

  261.                                If(left=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i-3;y:=j+3;Prior:=4;End;
    262. 

  262.                                If(Rigth=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i;y:=j;prior:=4;End;
    263. 

  263.                                If(Rigth=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i;y:=j;Prior:=4;End;
    264. 

  264. 

  265.                                    If(left=0)and(pole[i-2,j+2]=0)and(pole[i,j]=0)and
    266. 

  266.                                (Rigth=0)And(Sum=1)And(cx=1)And(proz=0) Then Begin x:=i-1;y:=j+1;Prior:=4;End;
    267. 

  267.                                    If(left=0)and(pole[i-2,j+2]=0)and(pole[i,j]=0)and
    268. 

  268.                                (Rigth=0)And(Sum=2)And(cx=2)And(proz=0) Then Begin x:=i-1;y:=j+1;Prior:=4;End;
    269. 

  269. 

  270.                              End;
    271. 

  271.       End;
    272. 

  272.      End;
    273. 

  273.    If (x>=1)and(x<=n)and(y>=1)and(y<=n)and((pole[x,y])=0) Then
    274. 

  274.                                                              Else Begin
    275. 

  275.                                                              prior:=1;
    276. 

  276.                                                              x:=0;y:=0;
    277. 

  277.                                                              End;
    278. 

  278.   End;
    279. 

  279. Procedure Diag3(Var cx,x,y,prior : byte);Far;
    280. 

  280.  Var
    281. 

  281.     i,j,left,Rigth,Proz,Sum,t: byte;
    282. 

  282.   Begin
    283. 

  283.     For t:=n-5 downto 1 do
    284. 

  284.      Begin
    285. 

  285.         i:=3;j:=t+3;
    286. 

  286.       While i<=4 do
    287. 

  287.           Begin
    288. 

  288.             Inc(j);Inc(i);
    289. 

  289.             Rigth:=pole[i+1,j+1];Left:=pole[i-3,j-3];
    290. 

  290.             Sum:=pole[i,j]+pole[i-1,j-1]+pole[i-2,j-2];
    291. 

  291.             Proz:=pole[i,j]*pole[i-1,j-1]*pole[i-2,j-2];
    292. 

  292.             If(left=0)and(rigth=0)and(sum=3)and(proz=1)and(prior<>5)then Begin x:=i+1;y:=j+1;prior:=5;End;
    293. 

  293.             IF(left=0)and(rigth=0)and(sum=6)and(proz=8)and(prior<>5)then Begin x:=i+1;y:=j+1;prior:=5;End;
    294. 

  294.             IF(left=2)and(rigth=0)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i+1;y:=j+1;prior:=5;end;
    295. 

  295.             IF(left=0)and(rigth=2)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i-3;y:=j-3;prior:=5;end;
    296. 

  296.             IF(left=1)and(rigth=0)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i+1;y:=j+1;prior:=5;end;
    297. 

  297.             IF(left=0)and(rigth=1)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i-3;y:=j-3;prior:=5;end;
    298. 

  298.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    299. 

  299.             (pole[i,j]=1)and(pole[i-2,j-2]=1)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    300. 

  300.             If(left=0)and(rigth=1)and(sum=2)and(proz=0)and
    301. 

  301.             (pole[i,j]=1)and(pole[i-2,j-2]=1)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    302. 

  302.             If(left=1)and(rigth=0)and(sum=2)and(proz=0)and
    303. 

  303.             (pole[i,j]=1)and(pole[i-2,j-2]=1)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    304. 

  304.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    305. 

  305.             (pole[i,j]=2)and(pole[i-2,j-2]=2)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    306. 

  306.             If(left=0)and(rigth=2)and(sum=4)and(proz=0)and
    307. 

  307.             (pole[i,j]=2)and(pole[i-2,j-2]=2)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    308. 

  308.             If(left=2)and(rigth=0)and(sum=4)and(proz=0)and
    309. 

  309.             (pole[i,j]=2)and(pole[i-2,j-2]=2)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    310. 

  310.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    311. 

  311.             (pole[i,j]=1)and(pole[i-1,j-1]=1)and(prior<>5)then Begin x:=i-2;y:=j-2;prior:=5;end;
    312. 

  312.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    313. 

  313.             (pole[i,j]=2)and(pole[i-1,j-1]=2)and(prior<>5)then Begin x:=i-2;y:=j-2;prior:=5;end;
    314. 

  314.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    315. 

  315.             (pole[i-2,j-2]=1)and(pole[i-1,j-1]=1)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    316. 

  316.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    317. 

  317.             (pole[i-2,j-2]=2)and(pole[i-1,j-1]=2)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    318. 

  318. 

  319.             If prior<>5 then Begin
    320. 

  320.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    321. 

  321.                                (pole[i,j]=1)and(pole[i-2,j-2]=1)and(cx=1)then Begin x:=i-1;y:=j-1;prior:=4;end;
    322. 

  322.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    323. 

  323.                                (pole[i,j]=2)and(pole[i-2,j-2]=2)and(cx=2)then Begin x:=i-1;y:=j-1;prior:=4;end;
    324. 

  324.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    325. 

  325.                                (pole[i-1,j-1]=1)and(pole[i-2,j-2]=1)and(cx=1)then Begin x:=i;y:=j;prior:=4;end;
    326. 

  326.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    327. 

  327.                                (pole[i-1,j-1]=2)and(pole[i-2,j-2]=2)and(cx=2)then Begin x:=i;y:=j;prior:=4;end;
    328. 

  328.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    329. 

  329.                                (pole[i-1,j-1]=1)and(pole[i,j]=1)and(cx=1)then Begin x:=i-2;y:=j-2;prior:=4;end;
    330. 

  330.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    331. 

  331.                                (pole[i-1,j-1]=2)and(pole[i,j]=2)and(cx=2)then Begin x:=i-2;y:=j-2;prior:=4;end;
    332. 

  332.                                If(Rigth=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i;y:=j;prior:=4;End;
    333. 

  333.                                If(Rigth=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i;y:=j;Prior:=4;End;
    334. 

  334.                                If(left=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i-3;y:=j-3;prior:=4;End;
    335. 

  335.                                If(left=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i-3;y:=j-3;Prior:=4;End;
    336. 

  336.                                           If(left=0)and(pole[i-2,j-2]=0)and(pole[i,j]=0)and
    337. 

  337.                                (Rigth=0)And(Sum=1)And(cx=1)And(proz=0) Then Begin x:=i-1;y:=j-1;Prior:=4;End;
    338. 

  338.                                             If(left=0)and(pole[i-2,j-2]=0)and(pole[i,j]=0)and
    339. 

  339.                                 (Rigth=0)And(Sum=2)And(cx=2)And(proz=0) Then Begin x:=i-1;y:=j-1;Prior:=4;End;
    340. 

  340.                              End;
    341. 

  341.       End;
    342. 

  342.      End;
    343. 

  343.    If (x>=1)and(x<=n)and(y>=1)and(y<=n)and((pole[x,y])=0) Then
    344. 

  344.                                                              Else Begin
    345. 

  345.                                                              prior:=1;
    346. 

  346.                                                              x:=0;y:=0;
    347. 

  347.                                                              End;
    348. 

  348.   End;
    349. 

  349. Procedure Diag4(Var cx,x,y,prior : byte);Far;
    350. 

  350.  Var
    351. 

  351.     i,j,left,Rigth,Proz,Sum,t: byte;
    352. 

  352.   Begin
    353. 

  353.     For t:=5 to n do
    354. 

  354.      Begin
    355. 

  355.         i:=3;j:=t-2;
    356. 

  356.       While j<=n-1 do
    357. 

  357.           Begin
    358. 

  358.             Inc(j);Inc(i);
    359. 

  359.             Rigth:=pole[i+1,j+1];Left:=pole[i-3,j-3];
    360. 

  360.             Sum:=pole[i,j]+pole[i-1,j-1]+pole[i-2,j-2];
    361. 

  361.             Proz:=pole[i,j]*pole[i-1,j-1]*pole[i-2,j-2];
    362. 

  362.             If(left=0)and(rigth=0)and(sum=3)and(proz=1)and(prior<>5)then Begin x:=i+1;y:=j+1;prior:=5;End;
    363. 

  363.             IF(left=0)and(rigth=0)and(sum=6)and(proz=8)and(prior<>5)then Begin x:=i+1;y:=j+1;prior:=5;End;
    364. 

  364.             IF(left=2)and(rigth=0)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i+1;y:=j+1;prior:=5;end;
    365. 

  365.             IF(left=0)and(rigth=2)and(sum=6)and(proz=8)and(prior<=5)then Begin x:=i-3;y:=j-3;prior:=5;end;
    366. 

  366.             IF(left=1)and(rigth=0)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i+1;y:=j+1;prior:=5;end;
    367. 

  367.             IF(left=0)and(rigth=1)and(sum=3)and(proz=1)and(prior<=5)then Begin x:=i-3;y:=j-3;prior:=5;end;
    368. 

  368.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    369. 

  369.             (pole[i,j]=1)and(pole[i-2,j-2]=1)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    370. 

  370.             If(left=0)and(rigth=1)and(sum=2)and(proz=0)and
    371. 

  371.             (pole[i,j]=1)and(pole[i-2,j-2]=1)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    372. 

  372.             If(left=1)and(rigth=0)and(sum=2)and(proz=0)and
    373. 

  373.             (pole[i,j]=1)and(pole[i-2,j-2]=1)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    374. 

  374.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    375. 

  375.             (pole[i,j]=2)and(pole[i-2,j-2]=2)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    376. 

  376.             If(left=0)and(rigth=2)and(sum=4)and(proz=0)and
    377. 

  377.             (pole[i,j]=2)and(pole[i-2,j-2]=2)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    378. 

  378.             If(left=2)and(rigth=0)and(sum=4)and(proz=0)and
    379. 

  379.             (pole[i,j]=2)and(pole[i-2,j-2]=2)and(prior<>5)then Begin x:=i-1;y:=j-1;prior:=5;end;
    380. 

  380.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    381. 

  381.             (pole[i,j]=1)and(pole[i-1,j-1]=1)and(prior<>5)then Begin x:=i-2;y:=j-2;prior:=5;end;
    382. 

  382.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    383. 

  383.             (pole[i,j]=2)and(pole[i-1,j-1]=2)and(prior<>5)then Begin x:=i-2;y:=j-2;prior:=5;end;
    384. 

  384.             If(left=1)and(rigth=1)and(sum=2)and(proz=0)and
    385. 

  385.             (pole[i-2,j-2]=1)and(pole[i-1,j-1]=1)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    386. 

  386.             If(left=2)and(rigth=2)and(sum=4)and(proz=0)and
    387. 

  387.             (pole[i-2,j-2]=2)and(pole[i-1,j-1]=2)and(prior<>5)then Begin x:=i;y:=j;prior:=5;end;
    388. 

  388. 

  389.             If prior<>5 then Begin
    390. 

  390.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    391. 

  391.                                (pole[i,j]=1)and(pole[i-2,j-2]=1)and(cx=1)then Begin x:=i-1;y:=j-1;prior:=4;end;
    392. 

  392.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    393. 

  393.                                (pole[i,j]=2)and(pole[i-2,j-2]=2)and(cx=2)then Begin x:=i-1;y:=j-1;prior:=4;end;
    394. 

  394.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    395. 

  395.                                (pole[i-1,j-1]=1)and(pole[i-2,j-2]=1)and(cx=1)then Begin x:=i;y:=j;prior:=4;end;
    396. 

  396.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    397. 

  397.                                (pole[i-1,j-1]=2)and(pole[i-2,j-2]=2)and(cx=2)then Begin x:=i;y:=j;prior:=4;end;
    398. 

  398.                                If(left=0)and(rigth=0)and(sum=2)and(proz=0)and
    399. 

  399.                                (pole[i-1,j-1]=1)and(pole[i,j]=1)and(cx=1)then Begin x:=i-2;y:=j-2;prior:=4;end;
    400. 

  400.                                If(left=0)and(rigth=0)and(sum=4)and(proz=0)and
    401. 

  401.                                (pole[i-1,j-1]=2)and(pole[i,j]=2)and(cx=2)then Begin x:=i-2;y:=j-2;prior:=4;end;
    402. 

  402.                                If(Rigth=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i;y:=j;prior:=4;End;
    403. 

  403.                                If(Rigth=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i;y:=j;Prior:=4;End;
    404. 

  404.                                If(left=1)and(sum=0)and(proz=0)and(cx=1)then Begin x:=i-3;y:=j-3;prior:=4;End;
    405. 

  405.                                If(left=2)and(sum=0)and(proz=0)and(cx=2)then Begin x:=i-3;y:=j-3;Prior:=4;End;
    406. 

  406.                                           If(left=0)and(pole[i-2,j-2]=0)and(pole[i,j]=0)and
    407. 

  407.                                (Rigth=0)And(Sum=1)And(cx=1)And(proz=0) Then Begin x:=i-1;y:=j-1;Prior:=4;End;
    408. 

  408.                                             If(left=0)and(pole[i-2,j-2]=0)and(pole[i,j]=0)and
    409. 

  409.                                 (Rigth=0)And(Sum=2)And(cx=2)And(proz=0) Then Begin x:=i-1;y:=j-1;Prior:=4;End;
    410. 

  410. 

  411.                              End;
    412. 

  412.       End;
    413. 

  413.      End;
    414. 

  414.    If (x>=1)and(x<=n)and(y>=1)and(y<=n)and(pole[x,y]=0) Then
    415. 

  415.                                                              Else Begin
    416. 

  416.                                                              prior:=1;
    417. 

  417.                                                              x:=0;y:=0;
    418. 

  418.                                                              End;
    419. 

  419.   End;
    420. 

  420. Procedure Grisha1(cx : byte;Var x,y : byte);Far;
    421. 

  421.  Var prior : byte;
    422. 

  422.   Begin
    423. 

  423.    Prior:=1;
    424. 

  424.                                 Gor(cx,x,y,prior);
    425. 

  425.                                 Ver(cx,x,y,prior);
    426. 

  426.                                 Diag1(cx,x,y,prior);
    427. 

  427.                                 Diag2(cx,x,y,prior);
    428. 

  428.                                 Diag3(cx,x,y,prior);
    429. 

  429.                                 Diag4(cx,x,y,prior);
    430. 

  430.     If (Prior=1)and(x=0)and(y=0)then Begin
    431. 

  431.                                        randomize;
    432. 

  432.                                        repeat
    433. 

  433.                                        x:=random(n)+1;
    434. 

  434.                                        y:=random(n)+1;
    435. 

  435.                                        until (Pole[x,y] = 0)and(x>=1)and(x<=n)
    436. 

  436.                                        and(y>=1)and(y<=n);
    437. 

  437.                                      End;
    438. 

  438. 

  439. 

  440.   End;
    441.