【codecombat】 试玩全攻略 第二章 边远地区的森林 woodlang cubbies

  第二章 边远地区的森林 woodlang cubbies

  这一关我们需要边移动边攻击发现的敌人,OK,使用之前学到的命令,hero.moveXY()和hero.findNearestEnemy()

  开始吧。

  

代码如下:

# Navigate through the woods, but be on the lookout!
# These forest cubbies may contain ogres!

hero.moveXY(19, 33)
enemy = hero.findNearestEnemy()
# The if-statement will check if a variable has an ogre.
if enemy:
    hero.attack(enemy)
    hero.attack(enemy)

hero.moveXY(49, 51)
enemy = hero.findNearestEnemy()
if enemy:
    # Attack the enemy here:
    hero.attack(enemy)
    hero.attack(enemy)
    
    # pass doesn't mean anything. It helps close if-statements.
    pass

hero.moveXY(58, 14)
enemy = hero.findNearestEnemy()
# Use an if-statement to check if enemy exists:
if enemy:
    # If enemy exists, attack it:
    hero.attack(enemy)
    hero.attack(enemy)
    
#想了解codecombat最全最好玩的攻略内容,欢迎访问节点亲王的博客园!
#转载请注明出处,否则作者有权追究法律责任!
转载请注明出处,否则作者有权追究法律责任! 转载请注明出处,否则作者有权追究法律责任!
原文地址:https://www.cnblogs.com/hali/p/6202812.html