Jack's River Race: Solving the Shortest Path Problem

In summary: That is, theta= cos^-1(3/5)= 53.13^o. To head his boat in that direction, he should aim the front of his boat upstream at an angle of 53.13^o above the perpendicular to the shore.In summary, Jack must reach the opposite side of the river in the shortest time to reach Jill, who remains stationary. To do this, he must row his boat at an angle of 53.13^o upstream
  • #1
Matthew
7
0
1.Jack is strolling along the bank of a 1-km wide River when the most beautiful girl materialises on the shore directly opposite him. Fearing she will disappear before he has a chance to establish face-to-face communication, he quickly devises a plan to reach the opposite shore in the shortest possible time. There is a rowboat breached on the shore right infront of him. He knows he can row at a speed of 6 km/h in still water and the current has a speed of 3 km/h. He must reach the opposite side of the river in the shortest time. His path includes a diagonal trip across the river followed by a sprint along the opposite shore to reach Jill. Jack has a standard sprinting speed of 10 km/h. What direction did he head his boat.

P.S I am still looking for number 2 on my other post. I thought I had the answer but it was wrong.
 
Physics news on Phys.org
  • #2
Technical point: you say in your post "He must reach the opposite side of the river in the shortest time." Taken literally, that would mean that it doesn't matter WHERE on the opposite shore he winds up and his running speed after he gets there is irrelevant.

I am going to take it that Jill will remain where she is and Jack wants to get to her position in the shortest time.

Let theta be the angle at which he rows relative to the straight line across the river (directly across would be theta= 0, aiming downstream positive, upstream negative). Since his speed in still water is 6 km/hr, his "velocity vector" would be (6 sin(theta), 6 cos(theta)). Since the river is flowing at 3 km/, its velocity vector is (3, 0) and Jack's "velocity made good" is (6 sin(theta)+ 3, 6 cos(theta)). He will cross the river in time t1 if
6 cos(theta)t1= 1 or t1= 1/(6 cos(theta)).

At that time, his position on the far shore will be (6 sin(theta)+ 3)sin(theta), positive if downstream from Jill, negative if upstream.
In any case, he now has that distance to run at 10 km/h
That will require time t2= 10(6 sin(theta)+ 3)sin(theta).
You want to minimize t1+ t2=
1/(6 cos(theta))+10(6 sin(theta)+ 3)sin(theta).

Differentiate with respect to theta and set equal to 0.
 
  • #3


Based on the given information, Jack's shortest path would be to row at a diagonal angle towards the opposite shore, taking into account the speed of the current. This would allow him to reach the opposite shore in the shortest amount of time. Once he reaches the shore, he should immediately sprint towards Jill at a speed of 10 km/h. Therefore, he should head his boat in a direction that is slightly angled towards the opposite shore, taking into consideration the speed of the current. This will allow him to reach his destination in the shortest amount of time and have the chance to establish communication with Jill.
 
  • #4


Jack's shortest path to reach the opposite shore would be to row diagonally across the river at an angle of 45 degrees. This is because the diagonal distance is shorter than the distance along the river bank, and rowing at an angle of 45 degrees would allow Jack to take advantage of the current and row at a faster speed of approximately 7.07 km/h (6 km/h + 3 km/h).

After reaching the opposite shore, Jack would then sprint at a speed of 10 km/h towards Jill. This combination of rowing and sprinting would allow Jack to reach Jill in the shortest possible time.

In order to determine the exact direction Jack should head his boat, we can use the concept of vector addition. The velocity of the boat can be represented by a vector with a magnitude of 7.07 km/h at an angle of 45 degrees. The velocity of the current can also be represented by a vector with a magnitude of 3 km/h at an angle of 180 degrees (opposite direction).

To determine the resultant velocity, we can use the Pythagorean theorem to calculate the magnitude of the resultant vector, which would be the speed at which Jack's boat would travel. The angle of the resultant vector can be calculated using trigonometric functions.

By using this method, we can determine that Jack should head his boat at an angle of 26.57 degrees (rounded to the nearest hundredth) in order to reach the opposite shore in the shortest time.
 

1. What is the shortest path problem?

The shortest path problem is a mathematical concept that involves finding the shortest path or route between two points in a given graph or network. It is commonly used in fields such as transportation, logistics, and computer science to optimize travel or communication routes.

2. What is Jack's River Race?

Jack's River Race is a problem that was created as a fun and interesting way to introduce the concept of the shortest path problem. It involves a race between two kayakers, Jack and Jill, down a river with multiple tributaries. The goal is to find the shortest path for Jack to take to reach the finish line before Jill.

3. How is Jack's River Race solved?

Jack's River Race is solved using various algorithms and techniques that are commonly used to solve the shortest path problem. These include Dijkstra's algorithm, A* search algorithm, and the Bellman-Ford algorithm. The specific approach used may vary depending on the specific problem and its constraints.

4. What is the significance of Jack's River Race?

Jack's River Race is a fun and engaging way to demonstrate the real-world applications of the shortest path problem. It helps to illustrate the importance of finding the most efficient route in various situations, such as navigation, transportation, and communication. It also showcases the use of algorithms and problem-solving techniques in solving complex problems.

5. What are some real-world examples of the shortest path problem?

There are numerous real-world examples of the shortest path problem, such as finding the most efficient routes for transportation systems, optimizing network communication paths, and determining the shortest distance for delivery routes. It is also commonly used in GPS navigation systems, logistics planning, and airline route planning.

Similar threads

  • Introductory Physics Homework Help
Replies
4
Views
1K
  • Introductory Physics Homework Help
Replies
9
Views
5K
  • Introductory Physics Homework Help
Replies
1
Views
2K
  • Introductory Physics Homework Help
Replies
12
Views
2K
  • Introductory Physics Homework Help
Replies
12
Views
4K
  • Introductory Physics Homework Help
Replies
8
Views
6K
  • Introductory Physics Homework Help
Replies
29
Views
3K
  • Introductory Physics Homework Help
Replies
4
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
3
Views
1K
  • Introductory Physics Homework Help
Replies
13
Views
3K
Back
Top