Method digWayToTile

source/ai/BaseAI.cpp:416–475

}

bool BaseAI::digWayToTile(Tile* tileStart, Tile* tileEnd)
{
    // We find a way to tileEnd. We search in reverse order to stop when we reach the first
    // accessible tile

    // Set a diggable path up to the first gold spot for the given team color, by the first available worker
    Seat* seat = mPlayer.getSeat();
    Creature* worker = mGameMap.getWorkerForPathFinding(seat);
    if (worker == nullptr)
        return false;

    std::list<Tile*> pathToDig = mGameMap.path(tileEnd, tileStart, worker, seat, true);
    if (pathToDig.empty())
        return false;

    // We search for the first reachable tile in the list
    bool isPathFound = false;
    for(std::list<Tile*>::iterator it = pathToDig.begin(); it != pathToDig.end();)
    {
        Tile* tile = *it;
        if(!isPathFound &&
           (tile->getFullness() == 0.0) &&
           (mGameMap.pathExists(worker, tileStart, tile)))
        {
            isPathFound = true;
        }

        if(isPathFound)
        {
            it = pathToDig.erase(it);
            continue;
        }

        // If the tile should be dug, we check if one of its neighboors can be reached.
        // If yes, we will stop after digging it to avoid digging through a wall as much as
        // possible
        for(Tile* t : tile->getAllNeighbors())
        {
            if(!isPathFound &&
               (t->getFullness() == 0.0) &&
               (mGameMap.pathExists(worker, tileStart, t)))
            {
                // we let the iterator increment because we want to dig the currently
                // tested tile
                isPathFound = true;
                break;
            }
        }

        ++it;
    }

    for(Tile* tile : pathToDig)
    {
        if (tile && tile->isDiggable(seat))
            tile->setMarkedForDigging(true, &mPlayer);
    }