Four prospectors with only one lantern must walk through a mine shaft. At most, two prospectors can travel together and any prospector in the shaft must be with the lantern. The prospectors, named Andrews, Blake, Johnson, and Kelly, can walk through the shaft in one minute, two minutes, four minutes, and eight minutes, respectively. When two walk together, they travel at the speed of the slower prospector. How can all four prospectors get through the mine shaft in only 15 minutes? After you have solved this problem, explain how you got your foot in the door.
Want to see the full answer?
Check out a sample textbook solutionChapter 5 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Additional Engineering Textbook Solutions
Java How To Program (Early Objects)
Starting Out with Programming Logic and Design (4th Edition)
Starting Out with C++ from Control Structures to Objects (9th Edition)
Introduction to Programming Using Visual Basic (10th Edition)
C Programming Language
- Blue-Eyed Island: A group of individuals live on an island until a visitor arrives with an unusual order: all blue-eyed people must leave the island as quickly as possible. Every evening at 8:00 p.m., a flight will depart. Everyone can see everyone else's eye colour, but no one knows their own (nor is anyone allowed to tell them). Furthermore, they have no idea how many people have blue eyes, but they do know that at least one person does. How long will it take for the blue-eyed individuals to leave?arrow_forwardMoon effect. Some people believe that the Moon controls their activities. If the Moon moves from being directly on the opposite side of Earth from you to being directly overhead, by what percentage does (a) the Moon's gravitational pull on you increase and (b) your weight (as measured on a scale) decrease? Assume that the Earth-Moon (center-to-center) distance is 3.82 x 10° m, Earth's radius is 6.37 x 106 m, Moon's mass is 7.36 x 1022 kg, and Earth's mass is 5.98 x 1024 kg. (a) Number 6.89 Units percent (b) Number i 6.8713e-4 Units percentarrow_forwardA hungry mouse wants to eat all four fruits in a maze such as the one below, in as few moves as possible.. At each turn the mouse can move any number of squares in one of the directions up, down, left or right, but it is not allowed to enter (or jump over) any walls (i.e., the black squares). Thus, the mouse moves just like a rook in chess. To eat a fruit, the mouse has to stop at that square. Assume that the maze has 4 fruits, and the size of b xh squares. 1. Give a suitable representatión of the states in this searching problem. 2. How many possible actions can the mouse perform at each move? (1.e., what is the branching factor?)arrow_forward
- Limurians live on the planet Lemuria where the passage of time is measured in lims (days), limhas (weeks),limahas (months) and limaals (years), where each limha (week) has 5 lims (days), and each limaha (month) has3 limhas (weeks) and each limaal (year) has 10 limahas (months).Given the name of a Limurian and the number of lims (days) the Limurian has lived on the planet, write aPython program to compute and print the Limurian’s age in limaals (years), limahas (months), limas (weeks)and lims (days).Call the file containing your program limurian_age.py.Sample input (shown in bold blue) and output from the program is as follows:Please enter Limurian's name: LimardPlease enter the number of lims that the Limurian has lived for: 3547Limurian Limard is 23 limaal(s), 6 limaha(s), 1 limha(s), and 2 lim(s)old.arrow_forwardMr Monkey is standing in front of a row of banana trees on Skull Island which actually belong to his rival King Kong. The banana trees are unusually high on that island. He wants to steal as many bananas as possible. Here is his plan. He will climb up one of the trees and then keep jumping from one tree to the immediately next one, while collecting all the bananas from each of them. But he will not switch the direction of his jumps. No longer being the agile young monkey he once used to be, he can only jump a total distance of L, after which he will climb down and run away before Kong crushes his head. Let the trees be labelled as t1, t2, ·.· tn. Let v;, Vi = 1, 2, · ..n be the number of bananas in tree t;. Further, let l;, i = 1,2, Can you write an algorithm to help Mr. Monkey steal as many bananas as possible ? Your algorithm should be a polynomial in n, L. Please show all the steps of DP as in the sample solution - subproblem definition, recurrences, pseudocode, runtime . (Statutory…arrow_forwardOn an island, a group of people are living until a visitor arrives with an odd directive: everyone with blue eyes must leave the island as quickly as possible. Every evening, a flight will depart at 8:00. Everyone can see the colour of everyone else's eyes, but they are blind to their own (nor is anyone allowed to tell them). They also do not know the number of persons who have blue eyes, but they do know that at least one person has them. How long will it take the folks with blue eyes to leave?arrow_forward
- • A circuit consists of a 12 V battery connected across a single resistor. If the current in the circuit is 3 A, calculate the size of the resistor. If a small appliance is rated at a current of 10 amps and a voltage of 120 volts, the power rating would be?.arrow_forwardYou visit an island of Knights, Knaves, and Spies. Knights always tell the truth, Knaves always lie, while Spies can say anything (truth or lie). You meet three inhabitants, John, Bill, and Tom. One is a Knight, one is a Knave, and one is a Spy. John says: “I am a knight", Bill says: “John is telling the truth," and Tom says: “I am the spy!". Determine what type of people John, Bill, and Tom arearrow_forwardMark loves to move fast. So he made a spaceship that works in 4-dimensional space. He wants to use the spaceship to complete missions as fast as possible. In each mission, the spaceship starts at (0, 0, 0, 0) and needs to end up at (a, b, c, d). To do this, he instructs the spaceship's computer to execute a series of moves, where each move is a unit step in one of the eight cardinal directions: (+1,0,0,0). (0,1,0,0), (0, 0, 1,0), (0, 0, 0, 1). Unfortunately, he also moved fast when building the spaceship, so there is a bug in the spaceship's code. The first move will be executed once, the second move will be executed twice, the third move will be executed thrice, and so on. In general, the i-th move will be executed ¿ times. For any four integers a, b, c, d, let f(a, b, c, d) be the minimum number of moves of a mission that ends up at (a, b, c, d). Compute the sum of f(a, b, c, d) over all points (with integer coordinates) such that A < a < A-Barrow_forwardOn Smullyan's Island, a place in which all inhabitants are either liars or truth- tellers, you come across two inhabitants, one named Daryl and the other named Rosita. Daryl says to you: "Neither of us are truth-tellers". What is Rosita? O There is not enough information Rosita is a truth-teller There is no Rosita O Rosita is a liararrow_forwardQ2/ The force between two charges is 120 N. If the distance between the charges is doubled, the force will be 60 N (a) O 30 N (b) O 40 N (c) O 15 N (d) Oarrow_forwardThere are four people who want to cross a rickety bridge; they all begin on the same side. You have 17 minutes to get them all across to the other side. It is night, and they have one flashlight. A maximum of two people can cross the bridge at one time. Any party that crosses, either one or two people, must have the flashlight with them. The flashlight must be walked back and forth; it cannot be thrown, for example. Person 1 takes 1 minute to cross the bridge, person 2 takes 2 minutes, person 3 takes 5 minutes, and person 4 takes 10 minutes. A pair must walk together at the rate of the slower person's pace. Write the specification of an algorithm that solves the problem.arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole