/**
 * TODO:
 *   Procházení skrz okraje
 *   Closest i diagonálně
*/


// created using DMD 2.054 64-bit
module MyBot;

import ants;
import std.stdio : stdout;
import std.algorithm : remove;
import std.string : indexOf;


bool notIn(Loc strange_ant, const(Loc)[] ants){
    foreach(ant; ants){
        if (strange_ant == ant)
            return false;
    }

    return true;
}


class MyBot : IBot {
    private Ants engine;
    public Loc[] planed_steps;
    public Direction[Loc] last_direction;

    /// vrati nejblizsi prvek z pole
    Loc findClosestDest(Loc ant, const(Loc)[] locations){
        Loc cl;
        foreach(l; locations){
            if (l == Loc()){
                cl = l;
                continue;
            }

            if (engine.distance(l, ant) < engine.distance(cl, ant))
                cl = l;
        }

        return cl;
    }

    /// vrati nejblizsi jidlo ke kteremu ma mravenec cisty pristup
    Loc findClosestClear(Loc ant, const(Loc)[] where){
        Loc[] cf;
        foreach(f; where){
            if (hasClearRoad(ant, f))
                cf ~= f;
        }

        return findClosestDest(ant, cf);
    }

    bool hasClearRoad(Loc ant, Loc dest){
        if (ant == dest)
            return true;

        auto d = closestDirection(ant, dest);
        Loc next = engine.destination(ant, d);

        return (engine.passable(next) && notIn(next, this.planed_steps) && notIn(next, this.engine.myAnts()) && hasClearRoad(next, dest);
    }

    void moveTo(Loc ant, Direction d){
        engine.issueOrder(ant, d);

        Loc next = engine.destination(ant, d);
        planed_steps ~= next;

        last_direction.remove(ant);
        last_direction[next] = d;
    }

    Direction closestDirection(const(Loc) ant, const(Loc) dest){
        struct smer{
            float l;
            Direction d;
        }

        smer s;
        foreach(d; engine.direction(ant, dest)){
            auto destination = engine.destination(ant, d);

            if (s == smer()){
                s.l =  engine.distance(ant, destination);
                s.d = d;
                continue;
            }

            if (s.l > engine.distance(ant, destination)){
                s.l = engine.distance(ant, destination);
                s.d = d;
            }
        }

        return s.d;
    }

    const(Loc)[] hillsToLoc(const(Hill)[] hills){
        const(Loc)[] l_hills;

        foreach(h; hills){
            l_hills ~= h.loc;
        }

        return l_hills;
    }

    void doTurn(Ants engine) {
        this.engine = engine;
        this.planed_steps = [];

        foreach(ant; engine.myAnts){
            Loc food  = findClosestClear(ant, engine.food());
            Loc enemy = findClosestClear(ant, engine.enemyAnts());
            if (engine.myAnts().length > engine.enemyAnts().length + 20 && enemy != Loc()){
                if (engine.enemyAnts().length < 20 && hillsToLoc(engine.enemyHills).length > 0)
                    enemy = findClosestClear(ant, hillsToLoc(engine.enemyHills));
                this.moveTo(ant, closestDirection(ant, enemy)); // mozna predelat na fci pro nejkratsi cestu?
            }else if (food != Loc()){
                this.moveTo(ant, closestDirection(ant, food)); // mozna predelat na fci pro nejkratsi cestu?
            }else{
                Direction new_d;
                if (ant in last_direction)
                    new_d = last_direction[ant];
                else
                    new_d = AIM[0];

                Loc antGoto = engine.destination(ant, new_d);
                int cnt = 0;
                while(!hasClearRoad(ant, antGoto) && cnt++ <= 4){
                    new_d = AIM["wnes".indexOf(new_d.key)];
                    antGoto = engine.destination(ant, new_d);
                }

                moveTo(ant, new_d);
            }
        }
    }
}



void main() {
    version(unittest) {
        // We don't run the bot or wait for input in this case
    } else {
        Ants.run(new MyBot());
    }
}