Library Tactitian- python


#1

I’m having some trouble seeing what I’m doing wrong. If someone could point me in the right direction it would be very appreciated. Thanks.

# Hushbaum has been ambushed by ogres!
# She is busy healing her soldiers, you should command them to fight!
# The ogres will send more troops if they think they can get to Hushbaum or your archers, so keep them inside the circle!

# Soldiers spread out in a circle and defend.
def commandSoldier(soldier, soldierIndex, numSoldiers):
    angle = Math.PI * 2 * soldierIndex / numSoldiers
    defendPos = {"x": 41, "y": 40}
    defendPos.x += 10 * Math.cos(angle)
    defendPos.y += 10 * Math.sin(angle)
    hero.command(soldier, "defend", defendPos);

# Find the strongest target (most health)
# This function returns something! When you call the function, you will get some value back.
def findStrongestTarget():
    mostHealth = 0
    bestTarget = None
    enemies = hero.findEnemies()
    # Figure out which enemy has the most health, and set bestTarget to be that enemy.
    enemyIndex=0
    if enemyIndex < len(enemies):
        enemy = enemies[enemyIndex]
        if enemy.health > mostHealth:
            mostHealth = enemy.health
            bestTarget = enemy
        enemyIndex += 1
        return bestTarget
    # Only focus archers' fire if there is a big ogre.
    if bestTarget and bestTarget.health > 15:
        return bestTarget
    else:
        return None


# If the strongestTarget has more than 15 health, attack that target. Otherwise, attack the nearest target.
def commandArcher(archer):
    nearest = archer.findNearestEnemy()
    if archerTarget:
        hero.command(archer, "attack", archerTarget)
    elif nearest:
        hero.command(archer, "attack", nearest)

archerTarget = None

while True:
    # If archerTarget is defeated or doesn't exist, find a new one.
    if not archerTarget or archerTarget.health <= 0:
        # Set archerTarget to be the target that is returned by findStrongestTarget()
        archerTarget = findStrongestTarget()
    
    friends = hero.findFriends()
    soldiers = hero.findByType("soldier")
    # Create a variable containing your archers.
    archers = hero.findByType("archer")
    for i in range(len(soldiers)):
        soldier = soldiers[i]
        commandSoldier(soldier, i, len(soldiers));
    # use commandArcher() to command your archers
    for j in range(len(archers)):
        archer = archers[j]
        commandArcher(archer);

#2

I think your FindStrongest function has a problem. You indented your

return bestTarget

one too much so that it would return more than one. You need to put it back so that it will only send one enemy after the function found out which one is the strongest.


#3

#not:
if enemyIndex < len(enemies):
…enemy = enemies[enemyIndex]
#but:
while enemyIndex < len(enemies):
…enemy = enemies[enemyIndex]


#4


what does this error mean?


#5

That error somehow disappeared but now I don’t know what I am doing wrong, another error message popped up.


#6

Look closely at line 34. Why are you defining nearest as find nearest librarian AND find nearest enemy? Who actually needs to find what here? The object here shouldn’t be hero and your archers don’t have a reason to be looking for librarians. Keep it simple.


#7

I got that, except now it keeps saying that archer has no function to find nearest enemy.


#8

I wasn’t saying to delete line 34, I meant it needs to be changed. You need to define nearest properly.