Calculate the number of rounds (“Rounds”) based on the number of sides on the dice. I am doing a project where I have the code for a 6 sided die and I have to roll two die at the same time that equal the corresponding round number. There are 11 rounds because a six sided die can add up from 2-12 . How should I approach this question? Thank you.

Calculate the number of rounds (“Rounds”) based on the number of sides on the dice. I am doing a project where I have the code for a 6 sided die and I have to roll two die at the same time that equal the corresponding round number. There are 11 rounds because a six sided die can add up from 2-12 . How should I approach this question? Thank you.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter23: Simulation With The Excel Add-in @risk

Section: Chapter Questions

Problem 7RP

See similar textbooks

Similar questions

Create a 32-sided die rolling simulation ( possible outcomes 1 - 32 ). 1. Roll the die and reply with commentary based on the following flow chart. 2. Keep track and display the number of times the user has rolled, the number of times she won, and the number of times she lost. 3. Ask the user if she would like to “roll again?”.
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Miles between Adjacent Towns Town A B C DE Destination Origin A 40 60 50 10 70 B 20 55 40 50 10 D 60 E 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem.
The Ibra College of Technology has an automated system that calculates the overall grade for each student of a class. The system gets to know the number of students in a class from the teacher. For each student, it asks their name and the number of subjects they took. For each subject, they ask the score. They then take the average of the scores of all the subjects, divide it by 10 and display the name and GPA for each student. Read the number of students in a class, the name and the number of subjects for each student. Then read the scores of each subject for each student, calculate the GPA by averaging the scores and dividing the average by 10. Finally, display the name and GPA for each student.
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Town Origin A B C D E A 40 Miles between Adjacent Towns C D E B 60 10 50 20 - 70 55 - 88811 40 50 10 Destination | | || 88 60 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem. Illustrate your work by using a table.…
A unit square is shown below. What will be the image of unit square after horizontal and vertical contraction and expansion.
Mark 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-B
Suppose you roll five, six sided dice. What are the total number of combinations (when order doesn't matter) of at least two of the five dice showing six?
The first application you will complete simulates a fight with the mythical greek hydra. As legend goes, if you were to chop off the head of a hydra, two smaller heads would grow back in its place. In order for our fight to have an end, we will assume that once the size of the targeted head is small enough, no new heads will grow back in its place. The goal of this application is to determine the amount of work required to kill a hydra with a single head, when the size of the head is given as input. Final output would look like this The head bag is Bag[ 3 ]The head bag is Bag[ 2 2 ]The head bag is Bag[ 2 1 1 ]The head bag is Bag[ 2 1 ]The head bag is Bag[ 2 ]The head bag is Bag[ 1 1 ]The head bag is Bag[ 1 ]The head bag is Bag[ ]The number of chops required is 7Run the program again using 4 for the size of the initial head. The work done should be 15.Run the program again using 5 for the size of the initial head. You should get the computation ended early.Run the program again using 6…
How many ways can you roll 2 dice so that the sum of the dots is either 7 or 11?
For this milestone, you will be making a more complicated pattern in each cell. You will be splitting the cell into several shapes and individually filling/coloring them in. You can still: decide whether the cells and its patterns are filled or unfilled choose the fill and pen colors using the user inputs Like the previous milestone, you will be asking for the fill colors for each individual shape/section as well. Sample output: Grid size (n): (input) Pen color: (input) Fill color: (input) Rectangle color: (input) Triangle color: (input) Each cell should have this drawing. The specific of this drawing is: A rectangle with a width 1/4 of the cell width and height the same as the cell Two triangles created by a diagonal line starting from the top right corner of the rectangle and ending on the bottom right of the cell You can simplify drawing the triangles by only drawing and filling in one of them, leaving the other as part of the cell background Here is a full grid with the cell…
If it's too long just work on what you can do and then I'll ask the question again to get the rest if needed Please type your solution so that I will be able to read them
Create your own multiplication game. How many users does the game allow at one time? What are the rules of the game? How does the game determine a winner? Use an example to simulate the game (a demo that shows how the game is played). You don't need to write a program in this exercise.