CEMC Banner

Problem of the Week
Problem B
Pathways

  1. Armaan walks to the zoo every day. A map of the streets between Armaan’s house and the zoo is shown, where Armaan’s house is represented by \(A\), the zoo is represented by \(Z\), and the streets are represented by line segments.

    A 3 by 3 grid of squares formed by 4 horizontal gridlines
intersecting with 4 vertical gridlines. The point A marks the top left
corner of the grid. The point Z marks the bottom right corner of the
grid.

    How many different routes can Armaan take from his house to the zoo if he always walks either east or south? Consider the top of the page to be north.

  2. On Tuesday there is some construction, so part of a street is closed, as shown.

    The middle third of the third vertical
gridline is blocked by a pylon.

    Armaan cannot walk on the closed part. How many different routes can Armaan take from his house to the zoo on Tuesday?

  3. On Friday, an intersection is closed, as shown.

    The intersection of the third horizontal
gridline and the third vertical gridline is blocked by a pylon.

    Armaan cannot walk through this intersection. How many different routes can Armaan take from his house to the zoo on Friday?

Themes: Computational Thinking, Geometry & Measurement