I cant’t solve this puzzle!!
My code is as follows:
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)_
_ self.command(soldier, “defend”, defendPos);_
def findStrongestTarget():
_ mostHealth = 0_
_ bestTarget = None_
_ enemies = self.findEnemies()_
_ enemyIndex = 0_
_ while len(enemies) > enemyIndex:_
_ enemy = enemies[enemyIndex]_
_ if enemy:_
_ enemyIndex += 1_
_ if enemy.health > mostHealth:_
_ mostHealth = enemy.health_
_ bestTarget = enemy_
_ _
_ if bestTarget and bestTarget.health > 15:_
_ return bestTarget_
_ else:_
_ return None_
def commandArcher(archer):
_ nearest = archer.findNearestEnemy()_
_ if archerTarget:_
_ self.command(archer, “attack”, archerTarget)_
_ elif nearest:_
_ self.command(archer, “attack”, nearest)_
_ _
archerTarget = None
loop:
_ if self.gold > self.costOf(“soldier”):_
_ self.summon(“soldier”)_
_ _
_ _
_ if not archerTarget or archerTarget.health <= 0:_
_ _
_ archerTarget = findStrongestTarget()_
_ _
_ friends = self.findFriends()_
_ soldiers = self.findByType(“soldier”)_
_ archers = self.findByType(“archers”)_
_ for i, soldier in enumerate(soldiers):_
_ commandSoldier(soldier, i, len(soldiers));_
_ _
_ _
_ for i in range(len(archers)):_
_ archer = archers[i]_
_ commandArcher(archer)_
This is my gear
I’ve spent multiple days searching the forum and it won’t work!!