(*

 * Hedgewars, a free turn based strategy game

 * Copyright (c) 2004-2011 Andrey Korotaev <unC0Rr@gmail.com>

 *

 * This program is free software; you can redistribute it and/or modify

 * it under the terms of the GNU General Public License as published by

 * the Free Software Foundation; version 2 of the License

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA

 *)

{$INCLUDE "options.inc"}

unit uAI;

interface

uses uFloat;

procedure initModule;

procedure freeModule;

procedure ProcessBot;

procedure FreeActionsList;

implementation

uses uConsts, SDLh, uAIMisc, uAIAmmoTests, uAIActions,

var BestActions: TActions;

    CanUseAmmo: array [TAmmoType] of boolean;

    StopThinking: boolean;

{$IFDEF USE_SDLTHREADS} 

    ThinkThread: PSDL_Thread = nil;

{$ELSE}

    ThinkThread: TThreadID;

{$ENDIF}

    hasThread: LongInt;

procedure FreeActionsList;

begin

AddFileLog('FreeActionsList called');

if hasThread <> 0 then

with CurrentHedgehog^ do

        if BotLevel <> 0 then

BestActions.Count:= 0;

BestActions.Pos:= 0

end;

const cBranchStackSize = 12;

type TStackEntry = record

                   WastedTicks: Longword;

                   MadeActions: TActions;

                   Hedgehog: TGear;

                   end;

var Stack: record

           Count: Longword;

           States: array[0..Pred(cBranchStackSize)] of TStackEntry;

           end;

function Push(Ticks: Longword; const Actions: TActions; const Me: TGear; Dir: integer): boolean;

var bRes: boolean;

begin

    bRes:= (Stack.Count < cBranchStackSize) and (Actions.Count < MAXACTIONS - 5);

    if bRes then

        with Stack.States[Stack.Count] do

            begin

            WastedTicks:= Ticks;

            MadeActions:= Actions;

            Hedgehog:= Me;

            Hedgehog.Message:= Dir;

            inc(Stack.Count)

            end;

    Push:= bRes

end;

procedure Pop(var Ticks: Longword; var Actions: TActions; var Me: TGear);

begin

    dec(Stack.Count);

    with Stack.States[Stack.Count] do

        begin

        Ticks:= WastedTicks;

        Actions:= MadeActions;

        Me:= Hedgehog

        end

end;

procedure TestAmmos(var Actions: TActions; Me: PGear; isMoved: boolean);

var BotLevel: Byte;

    ap: TAttackParams;

    Score, i: LongInt;

    a, aa: TAmmoType;

begin

BotLevel:= Me^.Hedgehog^.BotLevel;

for i:= 0 to Pred(Targets.Count) do

    if (Targets.ar[i].Score >= 0) and (not StopThinking) then

            a:= CurAmmoType;

{$IFDEF USE_SDLTHREADS}

{$ELSE}

{$ENDIF}       

        if (CanUseAmmo[a]) and

{$HINTS OFF}

{$HINTS ON}

                    begin

end;

procedure Walk(Me: PGear; var Actions: TActions);

const FallPixForBranching = cHHRadius * 2 + 8;

var

    ticks, maxticks, steps, tmp: Longword;

    BaseRate, BestRate, Rate: integer;

    GoInfo: TGoInfo;

    CanGo: boolean;

    AltMe: TGear;

    BotLevel: Byte;

    a: TAmmoType;

begin

ticks:= 0; // avoid compiler hint

Stack.Count:= 0;

for a:= Low(TAmmoType) to High(TAmmoType) do

    CanUseAmmo[a]:= Assigned(AmmoTests[a].proc) and HHHasAmmo(Me^.Hedgehog^, a);

BotLevel:= Me^.Hedgehog^.BotLevel;

tmp:= random(2) + 1;

Push(0, Actions, Me^, tmp);

Push(0, Actions, Me^, tmp xor 3);

BestRate:= RatePlace(Me);

BaseRate:= Max(BestRate, 0);

if (Ammoz[Me^.Hedgehog^.CurAmmoType].Ammo.Propz and ammoprop_NeedTarget) <> 0 then

    AddAction(Actions, aia_Weapon, Longword(amNothing), 100 + random(200), 0, 0);

while (Stack.Count > 0) and (not StopThinking) and (GameFlags and gfArtillery = 0) do

    begin

    Pop(ticks, Actions, Me^);

    AddAction(Actions, Me^.Message, aim_push, 250, 0, 0);

    steps:= 0;

    while (not StopThinking) do

{$HINTS OFF}

{$HINTS ON}

end;

function Think(Me: Pointer): ptrint;

var BackMe, WalkMe: TGear;

    StartTicks, currHedgehogIndex, itHedgehog, switchesNum, i: Longword;

    switchImmediatelyAvailable, switchAvailable: boolean;

    Actions: TActions;

begin

InterlockedIncrement(hasThread);

StartTicks:= GameTicks;

currHedgehogIndex:= CurrentTeam^.CurrHedgehog;

itHedgehog:= currHedgehogIndex;

switchesNum:= 0;

switchImmediatelyAvailable:= (CurAmmoGear <> nil) and (CurAmmoGear^.Kind = gtSwitcher);

switchAvailable:= HHHasAmmo(PGear(Me)^.Hedgehog^, amSwitch);

if (PGear(Me)^.State and gstAttacked) = 0 then

        // iterate over current team hedgehogs

        repeat

            WalkMe:= CurrentTeam^.Hedgehogs[itHedgehog].Gear^;

            Actions.Count:= 0;

            Actions.Pos:= 0;

            Actions.Score:= 0;

            if switchesNum > 0 then

                begin

                if not switchImmediatelyAvailable then

                    begin

                    // when AI has to use switcher, make it cost smth

                    Actions.Score:= -20000;

                    AddAction(Actions, aia_Weapon, Longword(amSwitch), 300 + random(200), 0, 0);                    

                    AddAction(Actions, aia_attack, aim_push, 300 + random(300), 0, 0);

                    AddAction(Actions, aia_attack, aim_release, 1, 0, 0);

                    end;

                for i:= 1 to switchesNum do

                    AddAction(Actions, aia_Switch, 0, 300 + random(200), 0, 0);

                end;

            Walk(@WalkMe, Actions);

            // find another hog in team

            repeat

                itHedgehog:= Succ(itHedgehog) mod CurrentTeam^.HedgehogsNumber;

            until (itHedgehog = currHedgehogIndex) or (CurrentTeam^.Hedgehogs[itHedgehog].Gear <> nil);

            inc(switchesNum);

        until (not (switchImmediatelyAvailable or switchAvailable))

            or StopThinking 

            or (itHedgehog = currHedgehogIndex)

            or BestActions.isWalkingToABetterPlace;

        if (BestActions.Score < -1023) and (not BestActions.isWalkingToABetterPlace) then

            begin

            BestActions.Count:= 0;

            AddAction(BestActions, aia_Skip, 0, 250, 0, 0);

            end;

    BackMe:= PGear(Me)^;

    while (not StopThinking) and (BestActions.Count = 0) do

        begin

        FillBonuses(true);

        WalkMe:= BackMe;

        Actions.Count:= 0;

        Actions.Pos:= 0;

        Actions.Score:= 0;

        Walk(@WalkMe, Actions);

        end

    end;

PGear(Me)^.State:= PGear(Me)^.State and not gstHHThinking;

Think:= 0;

InterlockedDecrement(hasThread)

end;

procedure StartThink(Me: PGear);

begin

if ((Me^.State and (gstAttacking or gstHHJumping or gstMoving)) <> 0)

//DeleteCI(Me); // this might break demo

Me^.State:= Me^.State or gstHHThinking;

Me^.Message:= 0;

BestActions.Count:= 0;

BestActions.Pos:= 0;

BestActions.Score:= Low(LongInt);

BestActions.isWalkingToABetterPlace:= false;

StopThinking:= false;

ThinkingHH:= Me;

FillTargets;

if Targets.Count = 0 then

FillBonuses((Me^.State and gstAttacked) <> 0);

AddFileLog('Enter Think Thread');

{$IFDEF USE_SDLTHREADS}

ThinkThread := SDL_CreateThread(@Think{$IFDEF SDL13}, nil{$ENDIF}, Me);

{$ELSE}

BeginThread(@Think, Me, ThinkThread);

{$ENDIF}

AddFileLog('Thread started');

end;

procedure ProcessBot;

const StartTicks: Longword = 0;

      cStopThinkTime = 40;

begin

with CurrentHedgehog^ do

        if ((Gear^.State and gstHHThinking) = 0) then

        else if ((GameTicks - StartTicks) > cMaxAIThinkTime)

end;

procedure initModule;

begin

    hasThread:= 0;

    ThinkThread:= ThinkThread;

end;

procedure freeModule;

begin

end;

end.