e) On the 7th floor of a fort lives a queen !! The floor has 17 dorms arranged in a row, Each dorm has doors connecting to the adjoining dorm as well as to the outside corridor. The queen sleeps in a different dorm each night by opening the door to an adjoining dorm (either side depending on her mood) and spending the night and the next day in that room, One day the king arrives at the fort and is searching for the queen. The security guard at the fort tells him of the queen's sleeping patterns and informs him that each morning he may knock on one of the outside doors only. If the queen happens to be behind that door, she will open it and consent to talk to him. The king also has a ticket to another neighboring kingdom in 30 days, so he can make at most 30 attempts. Can the king win the hand of the queen, and if so, what is his strategy ? Explain your solution in detail (you may use diagrams to explain if needed).

e) On the 7th floor of a fort lives a queen !! The floor has 17 dorms arranged in a row, Each dorm has doors connecting to the adjoining dorm as well as to the outside corridor. The queen sleeps in a different dorm each night by opening the door to an adjoining dorm (either side depending on her mood) and spending the night and the next day in that room, One day the king arrives at the fort and is searching for the queen. The security guard at the fort tells him of the queen's sleeping patterns and informs him that each morning he may knock on one of the outside doors only. If the queen happens to be behind that door, she will open it and consent to talk to him. The king also has a ticket to another neighboring kingdom in 30 days, so he can make at most 30 attempts. Can the king win the hand of the queen, and if so, what is his strategy ? Explain your solution in detail (you may use diagrams to explain if needed).

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter13: Decision Making Under Uncertainty

Section13.4: Decision Trees

Problem 5P

See similar textbooks

Similar questions

Indian cricket team Players at an winning celebration dine at a circular table on which there is a single fork between each Player. Players either eat or think, and always start dinner thinking. To eat, a Player first picks up the fork immediately to his left and, once successful, picks up the fork immediately to his right. When a required fork is not on the table, the Player waits, neither eating nor thinking, until the fork is returned to the table. After eating, a Player returns both forks to the table. No cutlery is required to think. Your task is to model the above scenario in Java. (a) Write a class called Fork with two public methods, ForkpickUp and ForkputDown. The methods should take no arguments and return no result. An instance of Fork should act as a lock to prevent concurrent access. In other words, once ForkpickUp has been called, all further calls to ForkpickUp should block until ForkputDown is called; when ForkputDown is called, one caller (if any) who is blocked should…
2. A man must ferry a goat, a wolf, and a head of cabbage across a river. The available boat, however, can carry only the man and one other thing. The goat cannot be left with the cabbage, nor can the wolf be left with the goat. How should the man ferry the three items across the river?
3. A technician takes X hours to visit the stores in a couple of streets in one shift, and when he finishes his tour, another technician revisits the same stores again, needing other X hours to finish the second shift, and so on. For example, if the first technician started his shift at 1:00pm, he finishes it at 7:00pm and the second technician starts his shift at 7:00pm and finishes it at 1:00am, and so on. The supervisors used to make a quick meeting with all technicians twice a day at 1:00 am and 1:00 pm, so they need to finish their tours exactly 1:00. Identify the mathematical notation for the number of shifts should be made by the technicians in order to achieve this, write the name of this mathematical value, and find it for two tours, one with X=7 and another with X = 11 .
VII.Let A = {2, 4, 6, 8}, B = {6, 9}, C = {4, 8}. Answer each of the following questions. Justify your answers.20.Is C ⊆ A?21.Is B ⊆ A?22.Is C ⊆ A?23. Is B ⊆B?
Required: Amitabh had a magical cat. That cat once fell down an empty well. As the walls of the well were not completely vertical, the cat could climb up the well. In one day, the cat can climb 1 unit height and the height of the well is h units. The cat starts at the bottom. Every day, a cat would divide into 2 cats. One of them would climb up 1 unit. The other would wait for help. But while waiting it would fall asleep and roll down 1 unit, unless it is already at the bottom, in which case it just remains there. When a cat would reach the top, it would run home toAmitabh. (Schrodinger doesn't know that some of the cats are in a well and so he can't rescue them). It has been d days since the cat fell into the well. How many cats would come out of the well today? You would notice that the number of cats grows very large with each passing day, so output the answer modulo 10^9+7. d = 0 means that the cat has fallen just now and so there's just one cat at the bottom of the well. So you…
4. Let N(x) be the statement “x has visited North Dakota,” where the domain consists of the students in your school. Express each of these quantifications in English. a) ∃x N(x) b) ∀x N(x) c) ˺∃x N(x) d) ∃x ˺N(x) e) ˺∀x N(x) f ) ∀x ˺N(x)
(v) to over come, rude above s: conquer, triumph over a: be vanquished, be defeated, succumb to
1- If the rat ate the cheese or the rat is not in the trap, then it is under the bed. The Rat is neither under the bed nor under the table. You will see the Rat Footprint unless It is under the table, or it is not in the trap. The Rat drinks the water if you see its footprint. The rat ate the cheese, or it did not eat the newspaper. Therefore, if the rat neither under the table nor under the bed, then it did not eat the newspaper but it drank the water. a. Covert the above argument into symbolic. b. Show that the argument is valid.
2. In Africa there is a very special species of bee. Every year, the female bees of such species give birth to one male bee, while the male bees give birth to one male bee and one female bee, and then they die! Now scientists have accidentally found one “magical female bee” of such special species to the effect that she is immortal, but still able to give birth once a year as all the other female bees. The scientists would like to know how many bees there will be after N years. Please write a program that helps them find the number of male bees and the total number of all bees after N years. Input Each line of input contains an integer N (≥ 0). Input ends with a case where N = −1. (This case should NOT be processed.) Output Each line of output should have two numbers, the first one being the number of male bees after N years, and the second one being the total number of bees after N years. (The two numbers will not exceed 232.) Sample Input 1 3 -1 Sample Output 1 2 4 7
VII.Let A = {2, 4, 6, 8}, B = {6, 9}, C = {4, 8}. Answer each of the following questions. Justify your answers. 1. Is B ⊆B?
11. A drawer contains 12 black socks and 12 white socks, all unmatched. A person takes socks out at random in the dark. Answer the following. o How many socks must they take out to be sure that they have at least two socks of the same color? o How many socks must they take out to be sure that they have at least two white socks?
State if each of the statements below is true or false (7) The environment of an artificial agent playing an asynchronous combat game against a human player is dynamic. (8) Robots must have vision in order to be considered intelligent. (9) Artificial agents using depth-first search are not intelligent agents. (17) Breadth-first search is ideal for a robot for finding a path to the shelf with the item of interest to a shopper at a very large grocery store, and guiding him/her to that shelf. (18) An artificial agent must be able to touch, see, and hear, in order to be utility-based. (19) A stationary robot standing at the center of a one-floor grocery store, just for finding the aisles shoppers should go to, to get the products they want, must find the aisles by searching by generating a tree. (20) Robots must have tactile sensors in order to be considered intelligent.