Sand Snakes - Python

Level Help
1

my
hero
never
moves
and
the
clues
are
useless
please
help

# This field is covered in firetraps.  Thankfully we've sent a scout ahead to find a path.  He left coins along the path so that if we always stick to the nearest coin, we'll avoid the traps.

# This canyon seems to interfere with your findNearest glasses!
# You'll need to find the nearest coins on your own.
coins = hero.findItems()
while True:
    coins = hero.findItems()
    coinIndex = 0
    nearest = None
    nearestDistance = 9999
    
    # Loop through all the coins to find the nearest one.
    while coinIndex < len(coins):
        coin = coins[coinIndex]
        coinIndex += 1
        distance = hero.distanceTo(coin)
        # If this coin's distance is less than the nearestDistance
        if coin.distance < nearestDistance:
            # Set nearest to coin
            nearest = coin
            # Set nearestDistance to distance
            nearestDistance = distance
            
    # If there's a nearest coin, move to its position. You'll need moveXY so you don't cut corners and hit a trap.

image
image1920Ă—963 578 KB

https://codecombat.com/play/level/sand-snakes?

2

After the if loop, there should be another if loop checking for nearest. Then you need to move to nearest’s position with moveXY.

3

My hero still doesnt move

4

Move with hero.moveXY to the nearest’s position x and position y.

5

That is exactly what i did.

# If there's a nearest coin, move to its position. You'll need moveXY so you don't cut corners and hit a trap.
    if nearest:
        hero.moveXY(nearest.pos.x, nearest.pos.y)
6

waiit… (20 chars)

7

nope.

    if nearest:
        hero.moveXY(coin.pos.x, coin.pos.y)

dont work.

8

Coin should be nearest. Maybe delete the if statement.

9

You literally told me to make it in the first place.

10

iT SHOULD BE
(Oops caps lock)

if (nearest) {
hero.moveXY(nearest.pos.x, nearest.pos.y);
11

HE/SHE IS USING PYTHON (oops caps lock)

1 Like
12

it seems that youve already defined

so remove the coin.All you need now is to check if there is a nearest coin and move to it :wink:

was the good answer but to make sure you did it right can you please post your code?

2 Likes
13

Ok now its being dumb and saying that my nearest code in the first .pos should be a hero.pos and giving me an error.

# This field is covered in firetraps.  Thankfully we've sent a scout ahead to find a path.  He left coins along the path so that if we always stick to the nearest coin, we'll avoid the traps.

# This canyon seems to interfere with your findNearest glasses!
# You'll need to find the nearest coins on your own.
coins = hero.findItems()
while True:
    coins = hero.findItems()
    coinIndex = 0
    nearest = None
    nearestDistance = 9999
    
    # Loop through all the coins to find the nearest one.
    while coinIndex < len(coins):
        coin = coins[coinIndex]
        coinIndex += 1
        distance = hero.distanceTo(coin)
        # If this coin's distance is less than the nearestDistance
        if coin.distance < nearestDistance:
            # Set nearest to coin
            nearest = coin
            # Set nearestDistance to distance
            nearestDistance = distance
            
    # If there's a nearest coin, move to its position. You'll need moveXY so you don't cut corners and hit a trap.
    hero.moveXY(nearest.pos.x, nearest.pos.y)
14

Ohp nevermind i put it in a if statement and the error went away

15

But my hero STILL DOESNT MOVE

16

You’ve already defined coin distance, you don’t need to do this. You can substite it with

Lydia

17

There is no coin.distance in my code. I have no idea what you are looking at.

18 
# This field is covered in firetraps.  Thankfully we've sent a scout ahead to find a path.  He left coins along the path so that if we always stick to the nearest coin, we'll avoid the traps.

# This canyon seems to interfere with your findNearest glasses!
# You'll need to find the nearest coins on your own.
coins = hero.findItems()
while True:
    coins = hero.findItems()
    coinIndex = 0
    nearest = None
    nearestDistance = 9999
    
    # Loop through all the coins to find the nearest one.
    while coinIndex < len(coins):
        coin = coins[coinIndex]
        coinIndex += 1
        distance = hero.distanceTo(nearest)
        # If this coin's distance is less than the nearestDistance
        if coin.distance < nearestDistance:
            # Set nearest to coin
            nearest = coin
            # Set nearestDistance to distance
            nearestDistance = distance
            
    # If there's a nearest coin, move to its position. You'll need moveXY so you don't cut corners and hit a trap.
    if nearest:
        hero.moveXY(nearest.pos.x, nearest.pos.y)
19

No, there is.

20

Where? I have looked through my code THREE TIMES. I swear its not there.