1. Given the diagram below, determine the number of pathways starting from A and moving to B along the gridlines if a pathway must always move closer to B.

View attachment 17006
2. Given the diagram below, determine the number of pathways starting from A and moving to B along the gridlines if a pathway must always move closer to B.

View attachment 17007
Please help me with these questions I do not know how to do it.

Hi danield3,

here's another way..

In part 1, the diagram is symmetrical.

If we find the number of ways to go from A to C

and the number of ways to go from C to B,

given the directional restriction,

we can multiply these to find the number of ways that require at least one internal path,

in going through C.

Add the external path.

The exact same number of ways are available in going across the top first.

In part 2, the ways can be summed independently from A to B through C,

A to B through D while avoiding E, and A to B through E avoiding D.