Problem 1: Tuple Tactics

A = (1, 2, (3, 4))
B = A[1::2]
x, y, z = A
for i in range(x):
    B += z
print(y * B[-2])

Problem 2a: Karel Trackers

• This is a coding problem. Work in pairs or trios on a single computer, and discuss your algorithm BEFORE YOU WRITE ANY CODE.
• The file positions.py exports a single constant called KAREL_POS, which is a list of tuples, recording what street and avenue intersection Karel is located at different elapsed times
  • The tuples are ordered by time, street (x), avenue (y)
• Your task:
  • Return the start and end times between which Karel moved the furthest
  • Since Karel can’t move diagonally, you can compute distance as \[ |x_1 - x_2| + |y_1 - y_2|\]

Problem 2b: Lazy Logging

• Swap who is typing!
• Sometimes Karel doesn’t move in a given interval
• Here, we’d like to enhance the existing records of Karel’s position by including a boolean flag if Karel moves in the following interval
  • The last record will always have None here, since we don’t know what the next position is
• For example, the left should become the right:

KAREL_POS = [
    (0, 4, 3),
    (1, 4, 3),
    (2, 3, 3),
    (3, 0, 2),
    (4, 0, 2)
]

KAREL_POS = [
    (0, 4, 3, False),
    (1, 4, 3, True),
    (2, 3, 3, True),
    (3, 0, 2, False),
    (4, 0, 2, None)
]

Yarn Art