If a person can only move from one grid box to a neighboring grid box: What is the shortest path between Point A and Point B? How many ways can a person move from Point A to Point B without never moving further away from Point B?

The shortest path between Point A and Point B is the direct diagonal path that goes through four grid boxes. To move from Point A to Point B without ever moving further away from Point B, there are three possible ways: 1) Move directly from A to B in a diagonal path 2) Move from A to the right side of B, then move up to reach B 3) Move from A to the bottom side of B, then move right to reach B These three paths all have the same number of moves, which is four.