How many ways can it reach?

The Amazoo delivery bot can move up, down, left, and right (not diagonally). In how many ways can it reach the yellow barn with exactly 10 moves.


The answer is 0.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

5 solutions

Hallow Gamer
Jun 14, 2020

What this is showing: What this is showing: the blue are two steps away from the barn the red are all two steps away from the blue the green are two steps away rom the red the red and blue are both two away from the barn and the blue you may notice that the green are one away from The Eye Of Amazoo but you have to get to the green (10-1=9). Then you use two more to get to the red(9-2=7) then the blue(7-2=5). since you need to burn off some steps, you can do 2 and not move(5-2=3). Now you cannot reach two from three by minus two, so it is impossible to reach the barn in 10 steps, or for that matter, any even amount of steps. If you have questions, please comment.

In an odd step we can go only to the black, and in an even, only to the white squares In an odd step we can go only to the black, and in an even, only to the white squares

Jomil Ariola
Jun 14, 2020

In the 4 by 5 grid, we imagine a board where the amazoo bot is in a black squared box and the barn is in a light squared box

If we go one move, we are in a white box, if 2 then a black box, so even moves (like 10) can only land in a black square, and since the barn is in a light square(odd) it is imposible to go to the barn with 10 moves

Eric Roberts
Jun 15, 2020

Let:

U U number of Upward Moves \quad D D number of Downward Moves \quad L L number of Left Moves \quad R R number of Right Moves

\quad

U D = 4 \displaystyle U - D = 4 ...Eq1

R L = 3 \displaystyle R- L = 3 ...Eq2

U + D + L + R = 10 \displaystyle U + D + L + R = 10 ...Eq3

By Eq1:

D = U 4 \displaystyle D = U -4 ...Eq1'

By Eq2:

L = R 3 \displaystyle L = R -3 ...Eq2'

Substitute Eq1' & Eq2' \to Eq3:

2 U + 2 R = 17 \displaystyle 2U + 2R = 17 ...Eq4

Since we require solutions for R R and U U to be in the positive integers, no solution exist because the LHS is always even and the RHS is odd.

Ashot Melkonyan
Aug 26, 2020

For the robot to reach the barn with the least number of steps it has to travel 3 steps to the right and 4 steps upwards (overall 7 steps). Any moves that are down or left displace the robot from a shortest path.

If the robot has to reach the barn with 10 steps it must take extra steps, particularly in leftward and downward directions. Whenever the robot goes left or down, it has to travel right or up respectively to compensate its displacement from the shortest path, which was 7 steps. These extra movements come in pairs so if the robot goes left once than it also has to travel to the right once at some point. Since the original number of steps without extra steps was 7, which is an odd number, any kind of extra movements will add 2 more steps, making it impossible to reach the goal of 10 steps, because it is an even number.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...