8. Pizza Mario owns a pizzeria. Mario makes all of his pizzas from 10 different ingredients, using 3 ingredients on each pizza. Mario's cousin Luigi owns a pizzeria as well. Luigi makes all his pizzas from 9 ingredients, using 4 ingredients on each pizza. Mario and Luigi have made a bet: Mario believes that customers can order a larger selection of pizzas in his pizzeria than they can order in Luigi's pizzeria. Use functions for this assignment. • Implement a factorial() function yourself (do not use the one from the math module) • When choosing k items fromn possible items, the number of possibilities can be obtained using the following formula: k!(n=k)! %3D Make a function called choose with two parameters n and k, that implements the above formula. • Write a program that calculates the number of pizzas Mario and Luigi can make. The outcome should look like this: Mario can make 120 pizzas. Luigi can make 126 pizzas. Luigi has won the bet.

8. Pizza Mario owns a pizzeria. Mario makes all of his pizzas from 10 different ingredients, using 3 ingredients on each pizza. Mario's cousin Luigi owns a pizzeria as well. Luigi makes all his pizzas from 9 ingredients, using 4 ingredients on each pizza. Mario and Luigi have made a bet: Mario believes that customers can order a larger selection of pizzas in his pizzeria than they can order in Luigi's pizzeria. Use functions for this assignment. • Implement a factorial() function yourself (do not use the one from the math module) • When choosing k items fromn possible items, the number of possibilities can be obtained using the following formula: k!(n=k)! %3D Make a function called choose with two parameters n and k, that implements the above formula. • Write a program that calculates the number of pizzas Mario and Luigi can make. The outcome should look like this: Mario can make 120 pizzas. Luigi can make 126 pizzas. Luigi has won the bet.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations

Problem 7P

See similar textbooks

Similar questions

QCC Casino Royale offers its customers a happy way to go home with big bucks playing its “Dice” game. The Dice game is played by asking customers to roll a pair of dice. If customers roll a seven or 11, they win; any other roll and the customer loses. The odds of rolling a seven is 6 to 1 so that if customers bet 1 dollar and win, they receive 7 dollars. The odds of rolling an eleven are 18 to 1 so that if customers bet 1 dollar and win, they receive 19 dollars. Upon entering the casino, customers must be greeted with an appropriate welcoming message. They must be asked to indicate the amount of money that is in their bankroll to play. Customers cannot enter the casino with a bankroll greater than $1,000. Customers must play the game in rounds of 10 plays and the minimum bet for each play is 5 dollars; the maximum bet is 50 dollars. For each try at rolling the dice, customers must be asked how much they want to bet and for each try must be informed of the result and the…
Q1. Let’s play a dice game with a pair of dice following these rules:1. At the beginning, you throw a pair of dice. If the two numbers add up to 5, 6, 7, 8, or 9, thegame immediately stops.2. If your first throw does not meet those 5 totals, you would continue until you get either 11 or12.Get 1000 simulations of this paired dice game. What is the average number of dice throw per game?You can use the sample() function to simulate the dice.
Imagine playing a number guessing game. A side is a number from 0 to Nhe's holding it, and the other side is trying to find that number by taking turns guessing. Number-holding side estimatehe has to offer one of the following three options in response to the party that did it:1-Your guess is correct, you found the number I kept (Game Over).2-Your estimate is wrong, but you are closer to the correct estimate than the previous estimate.3-the wrong estimate and the correct estimate are further away than the previous estimate.To find the estimated number in an environment where all the information is these, astrategy will be followed: Make a prediction (N/2) from the exact middle of N with 1 Begin:Find out the answer to your guess. [answer=answer_ogren (guess)]If the answer is equal to 1, the game is over, you can leave.If the answer is equal to 2, you are going in the right direction, keep the forecast direction;If you're heading for small numbers, the new N is now N/2.Make a guess…
he Dice game of “Pig” can be played with the following rules. Roll two six-sided dice. Add the face values together. Choose whether to roll the dice again or pass the dice to your opponent. If you pass, then you get to bank any points earned on your turn. Those points become permanent. If you roll again, then add your result to your previous score, but you run the risk of losing all points earned since your opponent had rolled. Continue to roll as much as you want. However, once a “1” comes up on either die, your score is reduced to 0, leaving you only with points that you have previously "banked." Furthermore, you must pass the dice to your opponent. The first person to 100 points is the winner. When a player rolls two dice, the possible outcomes are as follows: Die #2 Roll Roll a 1 Roll a 2 Roll a 3 Roll a 4 Roll a 5 Roll a 6 Die #1 Roll Roll a 1 0 0 0 0 0 0 Roll a 2 0 4 5 6 7 8 Roll a 3 0 5 6 7 8 9 Roll a 4 0 6 7 8 9 10 Roll a 5 0 7 8 9 10 11 Roll a 6 0 8 9 10…
Correct answer will be upvoted else Multiple Downvoted. Computer science. player begins the game from the 1-st stage and should beat the stages in expanding request of the stage number. The player dominates the match in the wake of beating the n-th stage. There is all things considered one designated spot on each stage, and there is consistently a designated spot on the 1-st stage. Toward the start of the game, just the designated spot on the 1-st stage is initiated, and any remaining designated spots are deactivated. At the point when the player gets to the I-th stage that has a designated spot, that designated spot is initiated. For each attempt of a phase, the player can either beat the stage or bomb the stage. On the off chance that they beat the I-th stage, the player is moved to the i+1-st stage. On the off chance that they bomb the I-th stage, the player is moved to the latest designated spot they actuated, and they need to beat the stages after that designated spot once…
Consider the following scenario:A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, thestudent opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the students have taken turns, some of the lockers are open and some are closed. The program see in the photo, when ran, should ask the user to enter the number of lockers in the school. The program will output the number of lockers and the…
In a game called NIM, there are two players. At the start, two piles of matches are placed on the table in front of them, each containing two matches. In turn, the players take any (positive) number of matches from one of the piles. The player taking the last match loses. Which player is sure to win in this game? O First Player O No answer text provided. O There is no way of knowing the outcome. O Second Player
Question 2: Three players (A, B and C) play the Card Game. Each player has two cards. The three players have the following card values: Player (A): 5 and 7 Player (B): 4 and 2 Player (C): 8 and 1 Player A starts by putting one card then Player B puts one card then player C puts one card and the game is over. The score of player A (utility value for A) is computed by the following formula: Score(A) = card value(A) - card value(B) - card value(C). The score of player B (utility value for B) is computed by the following formula: Score(B) = card value(B) - card value(A) - card value(C). The score of player C (utility value for C) is computed by the following formula: Score(C) card value(C) - card value(A) - card value(B). a) Construct the corresponding Game Tree. Then find the utility values of all nodes. b) Which player will win the game? c) Show how can the losers make the winner lose the game. What do you note?
In the game of blackjack, the cards 2 through 10 are counted at their face values, regardless of suit, all face cards (jack, queen, and king) are counted as 10, and an ace counted as either 1 or 11, depending on the total count of all the cards in a player's hand. The ace is counted as 11 only if the resulting total value all cards in a player's hand. The ace is counted as 11 only if the resulting total value of all cards in a player's hand does not exceed 21, else it is counted as a 1. Using this information write a C++ program that accepts three card values as inputs (a1 corresponding to an ace, a2 corresponding to a two, and so on), calculates the total value of the hand appropriately, and displays the value of the three cards with a printed message.
Correct answer will be upvoted else downvoted. Computer science. street is developed as follows: the main line comprises of 1 tile; then, at that point, a1 lines follow; every one of these lines contains 1 tile more noteworthy than the past line; then, at that point, b1 columns follow; every one of these lines contains 1 tile not exactly the past line; then, at that point, a2 columns follow; every one of these lines contains 1 tile more noteworthy than the past line; then, at that point, b2 lines follow; every one of these columns contains 1 tile not exactly the past line; ... then, at that point, a lines follow; every one of these columns contains 1 tile more prominent than the past line; then, at that point, bn columns follow; every one of these lines contains 1 tile not exactly the past line. You start from the main tile in the primary line and need to arrive at the last line (any tile of it). From your present tile, you can move to any tile in the…
A deck of cards contains 52 cards with four suits: club, diamond, heart and spade ranging in values from 2, ... to 10, Jack, Queen, King and Ace. Ace has the highest value in the same suit. Cards can be compared using the face value. A card with higher face value is bigger than a card with lower face value. If two cards have the same face value, then the suit determines the order. Club is smaller than diamond which is smaller than heart which is smaller than spade. For example: club 2 < diamond 2 < heart 2 < spade 2 if compared. Write an interactive Java program that allows a user to randomly pick a card from the deck of 52 cards (using a random number between 1 and 4 to represent the four suits: club, diamond, heart and spade and then another random number to represent the face value) to play. Show the suit and face value of the user card. Then the program acts as a card dealer which randomly draws another card and displays the card (again showing the suit and face value of…
Consider the following scenario: A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the students have taken turns, some of the lockers are open and some are closed. The program below, when ran, will prompt the user to enter the number of lockers in the school. After the game is over, the program will output the number of…