Answered: Give the required conditions for a…

Engineering

Computer Science

Give the required conditions for a stalemate to occur

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter18: Deterministic Dynamic Programming

Section18.1: Two Puzzles

Problem 1P

See similar textbooks

Similar questions

Four individuals wish to traverse an unstable bridge; they all start on the same side. You have 17 minutes to get everyone to the opposite side. Night has fallen, and they have only one torch. Two individuals may cross the bridge at once at most. Any crossing party, whether one or two individuals, must carry a torch. The torch must be carried back and forth; it cannot, for instance, be hurled. Person 1 crosses the bridge in one minute, person 2 in two minutes, person 3 in five minutes, and person 4 in ten minutes. A dyad must trek together at the slower individual's cadence. Create the algorithm specification that solves the problem.
Question 2: The Queen of Rankpur is very well known for the kind heart and her good things. She plans to host a Diwali dinner for all the K people (numbered from 1 to K) in the kingdom. The people and the queen feels it might be good to get them all together under one roof. However, she knows many of them really hate each other and seating them in the same dinner table may cause immediate problems. Luckily, there are 2 tables in the dining room and want to make sure it is su itable for all of them, and to make sure that the two owners, who kind of hate each other, do not sit at the same table. He will only hold for lunch as it is possible. You have to help him decide whether he will invite the owners or not, taking into account the above limitations. In addition, if he can join, he must help to find out the number of people who are sitting at the table. Please keep in mind that the number of people who have to sit at any table, it is not unique, and in this case, you must use every…
There are 6 cities with distances between them given by the table below: Draw and solve the TSP problem (going from city 1 to city 6 and then back to city 1, visiting each city once (except for city 1), no cycles allowed) using brute force approach
In order for there to be a stalemate, there are four requirements that need to be fulfilled.
The rook is a chess piece that may move any number of spaces either horizontally or vertically. Consider the “rooks problem” where we try to place 8 rooks on an 8x8 chess board in such a way that no pair attacks each other. a. How many different solutions are there to this?b. Suppose we place the rooks on the board one by one, and we care about the order in which we put them on the board. We still cannot place them in ways that attack each other. How many different full sequences of placing the rooks (ending in one of the solutions from a) are there?
You are the chief commander of US Army; you have been deployed in an ongoing war training of defusing the mine. Mines are placed on the ground which can be considered as a gird of size N*M. Each block (i, j) has a mine in it if and only if the summation of the block coordinates is divisible by 2. Your task is to move from the first row to the last row. The mines will not blow if the given rules are followed: • If you are on even row you can move to any cell that is in the neighborhood • If you are on odd row, you can only go the odd row that has mine on that and same with the unmined row. You have to develop a python program to calculate the number of ways to reach row number N starting from row number 1. Test Cases: 4 8 Output: 10
A school dance committee is to consist of 2 freshmen, 3 sophomores, 4 juniors, and 5 seniors. If 6 freshmen, 7 sophomores, 9 juniors, and 7 seniors are eligible to be on the committee, in how many ways can the committee be chosen? Your answer is:
Three prisoners have been sentenced to long terms in prison, but due to over crowed conditions, one prisoner must be released. The warden devises a scheme to determine which prisoner is to be released. He tells the prisoners that he will blindfold them and then paint a red dot or blue dot on each forehead. After he paints the dots, he will remove the blindfolds, and a prisoner should raise his hand if he sees at least one red dot on the other two prisoners. The first prisoner to identify the color of the dot on his own forehead will be release. Of course, the prisoners agree to this. (What do they have to lose?) The warden blindfolds the prisoners, as promised, and then paints a red dot on the foreheads of all three prisoners. He removes the blindfolds and, since each prisoner sees a red dot (in fact two red dots), each prisoner raises his hand. Some time passes when one of the prisoners exclaims, "I know what color my dot is! It's red!" This prisoner is then released. Your problem…
We are given three ropes with lengths n₁, n2, and n3. Our goal is to find the smallest value k such that we can fully cover the three ropes with smaller ropes of lengths 1,2,3,...,k (one rope from each length). For example, as the figure below shows, when n₁ = 5, n₂ 7, and n3 = 9, it is possible to cover all three ropes with smaller ropes of lengths 1, 2, 3, 4, 5, 6, that is, the output should be k = 6. = Devise a dynamic-programming solution that receives the three values of n₁, n2, and n3 and outputs k. It suffices to show Steps 1 and 2 in the DP paradigm in your solution. In Step 1, you must specify the subproblems, and how the value of the optimal solutions for smaller subproblems can be used to describe those of large subproblems. In Step 2, you must write down a recursive formula for the minimum number of operations to reconfigure. Hint: You may assume the value of k is guessed as kg, and solve the decision problem that asks whether ropes of lengths n₁, n2, n3 can be covered by…
Consider the following parlor game to be played between two players. Each player beginswith three chips: one red, one white, and one blue. Each chip can be used only once.To begin, each player selects one of her chips and places it on the table, concealed.Both players then uncover the chips and determine the payoff to the winning player.In particular, if both players play the same kind of chip, it is a draw; otherwise, thefollowing table indicates the winner and how much she receives from the other player.Next, each player selects one of her two remaining chips and repeats the procedure,resulting in another payoff according to the following table. Finally, each player playsher one remaining chip, resulting in the third and final payoff.Winning Chip Payoff ($)Red beats white 250White beats blue 100Blue beats red 50Matching colors 0(a) Formulate the payoff matrix for the game and identify possible saddle points.(b) Construct a linear programming model for each player in this game.(c)…
Consider the following parlor game to be played between two players. Each player beginswith three chips: one red, one white, and one blue. Each chip can be used only once.To begin, each player selects one of her chips and places it on the table, concealed.Both players then uncover the chips and determine the payoff to the winning player.In particular, if both players play the same kind of chip, it is a draw; otherwise, thefollowing table indicates the winner and how much she receives from the other player.Next, each player selects one of her two remaining chips and repeats the procedure,resulting in another payoff according to the following table. Finally, each player playsher one remaining chip, resulting in the third and final payoff.Winning Chip Payoff ($)Red beats white 250White beats blue 100Blue beats red 50Matching colors 0(a) Formulate the payoff matrix for the game and identify possible saddle points.(b) Construct a linear programming model for each player in this game.(c)…
In order to separate patients who are likely infected with the novel Corona Virus (Convid19) from other patients, Fafagh clinic records the temperature of all patients before triaging. According to a new policy of the clinic, the number of patients allowed should not exceed one hundred (100) in a day. The policy also stipulates that a patient should be considered for a malaria test when his/her temperature is between 38 degrees Celsius (°C) and 40 degrees Celsius (°C). Whilst a patient whose temperature is above 40 degrees Celsius should undergo the Convid19 test. Although the thermometer used to record the patient’s temperature is calibrated in Fahrenheit, the chart recommended by the policy for determining the test required (Malaria/Convid19) is specified in Celsius. Draw a flowchart for the above problem