Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

Python Python Collections (2016, retired 2019) Dungeon Game Hit points

Benjamin Bradshaw
Benjamin Bradshaw
3,208 Points

This is a hard challenge.

I don't feel I have been given the tools to figure this one out. My code looks super sloppy and there has to be a simpler way of writing this. I feel absolutely stumped

movement.py
# EXAMPLES:
# move((1, 1, 10), (-1, 0)) => (0, 1, 10)
# move((0, 1, 10), (-1, 0)) => (0, 1, 5)
# move((0, 9, 5), (0, 1)) => (0, 9, 0)

def move(player, direction):
    x, y, hp = player
    if direction == (-1,0):
        x -= 1
    elif direction == (1,0):
        x += 1
    elif direction == (0, -1):
        y -= 1
    else direction == (0, 1):
        y += 1
    if x >= 9:
        x -= 1
        hp -= 5
    elif x <= 0:
        x += 1
        hp -= 5
    elif y >= 9:
        y -= 1
        hp -= 5
    else y <= 0:
        y += 1
        hp -= 5
    return x, y, hp

1 Answer

Steven Parker
Steven Parker
231,275 Points

What about diagonal movement?

The instructions don't actually say if there are limits to movement either in direction or distance. So you might want to calculate the potential new position using both dimensions, and then check to see if it is to a valid point. This could help make your code much more compact as well.

Also remember that both 0 and 9 are valid positions in both dimensions.