// Sind Gegnersteine eingeschlossen, so dass welche geschlagen werden können? 
	// Direction: "+x" | "-x" | "+y" |
 "-y"  | "+x+y" | "-x-y" | "-x+y" | "+x-y" um nach rechts, links, oben, unten, diagonal rechts oben, diagonal links unten,
 diagalonal links oben, diagonal rechts unten, zu suchen
	function isEnemyIncluded(r : reversi; t : turn; direction : string) : boolean;
	var i,j : integer;
		{s : char;}
	begin
		isEnemyIncluded := false;
		
		// s ist der jeweilige Gegnerchar
		{s := inverseChar(t.c);}
		
		// Horizontal
		if direction = '+x' then begin
			i := t.x+1;
			while (i <= 8) {and (r.table[i, t.y] = s)} do begin
				if (r.table[i, t.y] = t.c) then isEnemyIncluded := true;
				i := i+1
			end
		end else if direction = '-x' then begin
			i := t.x-1;
			while (i > 0) {and (r.table[i, t.y] = s)} do begin
				if (r.table[i, t.y] = t.c) then isEnemyIncluded := true;
				i := i-1
			end
		// Vertikal
		end else if direction = '+y' then begin
			i := t.y+1;
			while (i <= 8) {and (r.table[t.x, i] = s)} do begin
				if (r.table[t.x, i] = t.c) then isEnemyIncluded := true;
				i := i+1
			end			
		end else if direction = '-y' then begin
			i := t.y-1;
			while (i > 0) {and (r.table[t.x, i] = s)} do begin
				if (r.table[t.x, i] = t.c) then isEnemyIncluded := true;
				i := i-1
			end
		// Diagonal
		end else if direction = '+x+y' then begin
			i := t.x+1;
			j := t.y+1;
			while (i <= 8) and (j <= 8) {and (r.table[i,j] = s)} do begin
				if (r.table[i,j] = t.c) then isEnemyIncluded := true;
				i := i+1;
				j := j+1
			end
		end else if direction = '-x-y' then begin
			i := t.x-1;
			j := t.y-1;
			while (i > 0) and (j > 0) {and (r.table[i,j] = s)} do begin
				if (r.table[i,j] = t.c) then isEnemyIncluded := true;
				i := i-1;
				j := j-1
			end
		end else if direction = '+x-y' then begin
			i := t.x+1;
			j := t.y-1;
			while (i <= 8) and (j > 0) {and (r.table[i,j] = s)} do begin
				if (r.table[i,j] = t.c) then isEnemyIncluded := true;
				i := i+1;
				j := j-1
			end
		end else if direction = '-x+y' then begin
			i := t.x-1;
			j := t.y+1;
			while (i > 0) and (j <= 8) {and (r.table[i,j] = s)} do begin
				if (r.table[i,j] = t.c) then isEnemyIncluded := true;
				i := i-1;
				j := j+1
			end	
		
		end		
	end;

for dx:=-1 to +1 do
 for dy:=-1 to +1 do
  if check_direction(feld,x,y,dx,dy) then er_darf_das:=true; 
 end
end

function check_direction(feld,start_x,start_y,dx,dy):boolean;
 farbe:=feld[x,y];
 kriterium:=gegenteil[farbe];
 x:=start_x+dx;
 y:=start_y+dy;
 check_direction:=false;
 repeat
  x:=x+dx;
  y:=y+dy;
  if ((not (x in [1..8]))or(not(y in [1..8]))) then break;  
  if feld[x,y]=" " then break;
  if feld[x,y]=kriterium then begin check_direction:=true; break; end;
 until false;
end

INSERT OR REPLACE INTO dumpdb.user_overview (SELECT * FROM user_overview);