Changeset 25 for trunk

Timestamp:

Mar 3, 2014, 12:42:16 AM (11 years ago)

Author:

chronos

Message:

• Added: Implement basic computer strategy to attack to weaker neighbours.

Location:

trunk

Files:

• UCore.pas (modified) (1 diff)
• UFormMain.pas (modified) (1 diff)
• UGame.pas (modified) (5 diffs)

trunk/UCore.pas

@@ -89 +89 @@
   FormMain.Redraw;
   while Game.Running and (Game.CurrentPlayer.Mode <> pmHuman) do begin
+    if Game.CurrentPlayer.Mode = pmComputer then
+      Game.CurrentPlayer.ComputerTurn;
     Game.NextTurn;
     FormMain.Redraw;

trunk/UFormMain.pas

@@ -73 +73 @@
 procedure TFormMain.PaintBox1Paint(Sender: TObject);
 begin
-  if Core.Game.Running then
+  //if Core.Game.Running then
+  if Assigned(Core.Game.CurrentPlayer) then
   with Core.Game.CurrentPlayer do begin
     View.DestRect := Bounds(0, 0, PaintBox1.Width, PaintBox1.Height);

trunk/UGame.pas

@@ -39 +39 @@
     destructor Destroy; override;
   end;
+
+  TCellArray = array of TCell;
 
   { TMap }
@@ -77 +79 @@
     DefaultCellSize: TPoint;
     Cells: array of array of TCell;
+    function IsValidIndex(Index: TPoint): Boolean;
+    function GetCellNeighbours(Cell: TCell): TCellArray;
     function PosToCell(Pos: TPoint; View: TView): TCell;
     function CellToPos(Cell: TCell; View: TView): TPoint;
@@ -309 +313 @@
 
 procedure TPlayer.ComputerTurn;
-begin
-
+var
+  Cells: TCellArray;
+  X, Y: Integer;
+  Target: TCell;
+  MinPower: Integer;
+  I: Integer;
+begin
+  for Y := 0 to Game.Map.Size.Y - 1 do
+  for X := 0 to Game.Map.Size.Y - 1 do
+  with TCell(Game.Map.Cells[Y, X]) do begin
+    if Player = Self then begin
+      // Search not own neighbour with lowes power
+      Cells := Game.Map.GetCellNeighbours(Game.Map.Cells[Y, X]);
+      Target := nil;
+      for I := 0 to Length(Cells) - 1 do
+      if (Cells[I].Terrain <> ttVoid) and (Cells[I].Player <> Self) then begin
+        if I = 0 then begin
+          MinPower := Cells[I].Power;
+          Target := Cells[I];
+        end else if Cells[I].Power < MinPower then begin
+          MinPower := Cells[I].Power;
+          Target := Cells[I];
+        end;
+      end;
+      // Attack if target is weaker
+      if Assigned(Target) and (Target.Power < Power) then
+        Game.SetMove(Game.Map.Cells[Y, X], Target);
+    end;
+  end;
 end;
 
@@ -415 +446 @@
     CountOnce := TMove(Moves[I]).CountOnce;
     CountRepeat := TMove(Moves[I]).CountRepeat;
-    if Assigned(FOnMove) then FOnMove(CellFrom, CellTo, CountOnce, CountRepeat, True);
+    if Assigned(CurrentPlayer) and (CurrentPlayer.Mode = pmHuman) and
+      Assigned(FOnMove) then FOnMove(CellFrom, CellTo, CountOnce, CountRepeat, True);
   end else begin
     CountOnce := CellFrom.Power;
     CountRepeat := 0;
-    if Assigned(FOnMove) then FOnMove(CellFrom, CellTo, CountOnce, CountRepeat, False);
+    if Assigned(CurrentPlayer) and (CurrentPlayer.Mode = pmHuman) and
+      Assigned(FOnMove) then FOnMove(CellFrom, CellTo, CountOnce, CountRepeat, False);
   end;
   if I < Moves.Count then begin
@@ -599 +632 @@
       Cells[Y, X] := NewCell;
     end;
+  end;
+end;
+
+function THexMap.IsValidIndex(Index: TPoint): Boolean;
+begin
+  Result := (Index.X >= 0) and (Index.X < Size.X) and
+    (Index.Y >= 0) and (Index.Y < Size.Y);
+end;
+
+function THexMap.GetCellNeighbours(Cell: TCell): TCellArray;
+var
+  X, Y: Integer;
+begin
+  SetLength(Result, 0);
+  for Y := -1 to 1 do
+  for X := -1 to 1 do
+  if IsValidIndex(Point(Cell.Pos.X + X, Cell.Pos.Y + Y)) and
+  IsCellsNeighbor(Cell, Cells[Cell.Pos.Y + Y, Cell.Pos.X + X]) then begin
+    SetLength(Result, Length(Result) + 1);
+    Result[Length(Result) - 1] := Cells[Cell.Pos.Y + Y, Cell.Pos.X + X];
   end;
 end;