Prime Pathing PLZ help... [Python]

[Mumbo_6]

I am stuck on prime pathing and I have been trying for so long now, can anyone help?

# Get all your troops to the end of the path by passing over the mines.
# You can locate duds by finding the mines that have a value that is a prime number.
# Check the guide for clarification.

def primeCheck(number):
    for i in range(2,(number**0.5)):
        if number % i == 0:
            return False
    return True

friends = hero.findFriends()
mines = hero.findHazards()
firstMines = []
for mine in mines:
    if mine.pos.y > 30 and mine.pos.x < 80:
        if primeCheck(mine.value):
            firstMines.append(mine)
for mine in firstMines:
    if mine.pos.x > (hero.pos.x - 25):
        hero.moveXY(mine.pos.x + 10, mine.pos.y)
        hero.moveXY(mine.pos.x, mine.pos.y)
        hero.moveXY(hero.pos.x - 10, hero.pos.y)
        for friend in friends:
            hero.command(friend, "move", {"x": mine.pos.x + 10, "y": mine.pos.y})
            hero.wait(1.6)
            hero.command(friend, "move", {"x": mine.pos.x, "y": mine.pos.y})
            hero.command(friend, "move", {"x": mine.pos.x - 10, "y": mine.pos.y})
hero.moveXY(2, 15)
for friend in friends:
    hero.command(friend, "move", {"x": 2, "y": 15})

secondMines = []
for mine in mines:
    if mine.pos.y < 30 and mine.pos.x < 80:
        if primeCheck(mine.value):
            secondMines.append(mine)
while hero.pos.x < 75:
    for mine in secondMines:
        if mine.pos.x < (hero.pos.x + 25) and mine.pos.x > hero.pos.x:
            hero.moveXY(mine.pos.x - 10, mine.pos.y)
            hero.moveXY(mine.pos.x, mine.pos.y)
            hero.moveXY(hero.pos.x + 10, hero.pos.y)
            for friend in friends:
                hero.command(friend, "move", {"x": mine.pos.x - 5, "y": mine.pos.y})
                hero.wait(1.6)
                hero.command(friend, "move", {"x": mine.pos.x, "y": mine.pos.y})
                hero.command(friend, "move", {"x": mine.pos.x + 12, "y": mine.pos.y})

My hero makes it past the top mines, but not the bottom ones.

[AnSeDra]

What is the part of the code that finds put if a number is prime or not? Because I would like to help you understand the strategy then you could complete the bonus. I will help you in a copule of hours since I can not use my computer since then so I can test your code and see what is wrong.

Andrei

[Mumbo_6]

@Mumbo_6

def primeCheck(number):
    for i in range(2,(number**0.5)):
        if number % i == 0:
            return False
    return True

This is the part where you can check whether the number is prime or not.

Mumbo_6

[Mumbo_6]

I dont know if it matters, but here is my equipment.

[PeterPalov]

Try:

def primeCheck(number):
    if number%2 !=0:
        return False
    else:
        return True

[Mumbo_6]

nope, sorry but my hero just walks into a trap

[PeterPalov]

But traps, that are prime don’t work, and you can go only on them.

[Mumbo_6]

yea, but my hero walks into a non-prime trap. Then it goes BOOM and kills me + my paladin.

Mumbo_6

[Mumbo_6]

with your code. (not being mean)

[PeterPalov]

Try to walk alone.

[Mumbo_6]

I do walk alone, but the explosion is so big it kills my paladin as well. Sorry, but your code in function is not working for me.

Mumbo_6

[Mumbo_6]

This is what happens

[PeterPalov]

Sorry, it’s wrong. I forgot how did I solve it…

[Mumbo_6]

No problem, everyone makes mistakes. Do you know anyone that can help me beat my last ufinished level CoCo?

Mumbo_6

[PeterPalov]

Maybe @Deadpool198? (20 chars)

[Mumbo_6]

its 7 AM in the morning for him. I doubt that he is on the forum right now…

Mumbo_6

[PeterPalov]

Or 6. I have 9.

[Mumbo_6]

well, it says on his profile that he is in the UK and the UK only has one time zone, which is -1 hour from me and -2 hours from you. So do some math here equals what?

[Mumbo_6]

@Chaboi_3000? where did your message go?

[PeterPalov]