THOUGHT PROCESS
Today we covered defining and calling
functions, Reeborg’s World, indentation (i.e., tabs or 4 spaces), I might watch
Silicon Valley, I prefer tabs over spaces because you just have to do it once.
We also covered the while loop (and compared
it to the for loop), the infinite loop (print out your condition if you do not
know why you are getting an infinite loop.),
Reeborg Hurdle 1 Loop Challenge:
My Code:
def turn_right():
turn_left()
turn_left()
turn_left()
def jump():
turn_left()
move()
turn_right()
move()
turn_right()
move()
turn_left()
def move_and_jump():
move()
jump()
for reeborg in range(6):
move_and_jump()
# I am actually getting 1% better each day
now
My Code:
def turn_right():
turn_left()
turn_left()
turn_left()
def jump():
turn_left()
move()
turn_right()
move()
turn_right()
move()
turn_left()
def move_and_jump():
move()
jump()
while True:
move_and_jump()
if
at_goal() == True:
break
I did not use negation, ouch.
My Code:
# What you need to know
# The functions move() and turn_left().
# The conditions front_is_clear() or
wall_in_front(), at_goal(), and their negation.
# How to use a while loop and an if
statement.
# Your program should also be valid for
worlds Hurdles 1 and Hurdles 2.
def turn_right():
turn_left()
turn_left()
turn_left()
def jump():
turn_left()
move()
turn_right()
move()
turn_right()
move()
turn_left()
def move_and_jump():
move()
jump()
while not at_goal():
if
front_is_clear():
move()
else:
jump()
My Code:
def turn_right():
turn_left()
turn_left()
turn_left()
def jump():
turn_left()
while is_facing_north() and wall_on_right():
move()
if
is_facing_north() and right_is_clear():
turn_right()
if front_is_clear():
move()
if front_is_clear() and right_is_clear():
turn_right()
while not at_goal():
if
is_facing_north() and right_is_clear():
turn_right()
elif front_is_clear():
move()
else:
jump()
it is nerve racking watching Reeborg move.
I could not complete the maze..
My Incomplete Code:
# Lost in a maze
# Reeborg was exploring a dark maze and the
battery in its flashlight ran out.
# Write a program using an if/elif/else
statement so Reeborg can find the exit.
# The secret is to have Reeborg follow along
the right edge of the maze, turning right if it can, going straight ahead if it
can’t turn right, or turning left as a last resort.
# What you need to know
# The functions move() and turn_left().
# Either the test front_is_clear() or
wall_in_front(), right_is_clear() or wall_on_right(), and at_goal().
# How to use a while loop and if/elif/else
statements.
# It might be useful to know how to use the
negation of a test (not in Python).
def turn_right():
turn_left()
turn_left()
turn_left()
while not at_goal():
while front_is_clear():
move()
if
wall_in_front():
turn_right()
else:
turn_left()
# of course, it does not work but it is sad
that I could not finish.
Done. :)
Comments
Post a Comment