MASSACHUSETTS INSTITUTE OF TECHNOLOGY
|
|
- Kelley Watts
- 5 years ago
- Views:
Transcription
1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Optimization Methods in Management Science (Spring 2007) Problem Set 7 Due April 12 th, 2007 at :30 pm. You will need 157 points out of 185 to receive a grade of 5. Problem 1: Max Flows and Minimum Cuts (50 Points) Part A: (10 Points) Find the maximum flow from source to sink for the network in Figure 1. Part B: (10 Points) Find the maximum flow from source to sink for the network in Figure 2. Part C: (5 Points) Find a cut whose capacity equals the maximum flow for the network in Figure 1. Part D: (5 Points) Find a cut whose capacity equals the maximum flow for the network in Figure 2. Part E: (10 Points) Suppose for an S-T path we call the pitch of the path as smallest of the arc capacities on the path. Modify the shortest path algorithm to find the total pitch (sum of all the pitches) of the network in figure 2. Part F: (10 Points) Suppose for an S-T path we call the strength of the path as the amount we can send on the path is the product of the arc capacities on the path. Modify the shortest path algorithm to find the total strengths (sum of all the strengths. of the network in figure 1. Page 0 of 11
2 Figure s 1 t Figure s t 7 Problem 2: Network Conversions: (32 Points; Points Each) Part A: Suppose the total flow into a node of a network is restricted to be 10 or less. How can we modify a network to incorporate this restriction? Suppose a network contains a finite number of arcs and the capacity of each arc is an integer. Answer the following questions: Part B: Page 1 of 11
3 Explain why the Ford Fulkerson method will find the max flow in a finite number of steps. Part C: True or False: The max flow solution found by the Ford Fulkerson algorithm will be integral (Explain your answer). Part D: The network in Figure 3 has two source nodes and two sink nodes. A feasible flow must satisfy conservation of flow at nodes 1 and 2 (flow in = flow out), and we want to maximize the sum of the flows out of s 1 and s 2. Convert this to an equivalent maximum flow problem with a single source node and single sink node. (HINT: you don t have to delete any nodes of the network below. The transformation will involve adding nodes and arcs to the network. Figure 3 t 1 s s t 2 Remark: If the objective is to send flow from s1 to t1 and to send flow from s2 to t2, it cannot in general be modeled as a max flow problem. In this case, the problem would be a multicommodity flow problem. In parts E to H you are permitted to have a network with more than one arc from i to j, and each arc will have its own capacity. Such arcs are called parallel arcs. An example could be obtained from Figure 1 if we replaced the arc (1, 3) with two arcs both directed from node 1 to node 3 with capacities and 5. In fact, two arcs with capacities and 5 would be equivalent to a single arc with capacity 9 in terms of the value of the max flow. We ask you to come up with examples of networks illustrating certain properties. When we say that 2 nodes are enough, we mean that the only nodes are s and t. If we say that three nodes are enough, we mean s, t and one other node. Page 2 of 11
4 Part E: Give an example of a network, with all integral arc capacities having a unique maximum flow (that is, there is only one assignment of flows to arcs that will achieve the maximum flow) and a unique minimum cut. (2 nodes will be enough). Part F: Give an example of a network, with all integral arc capacities having more than one maximum flows and a unique minimum cut. (3 nodes will be enough if you permit parallel arcs.) Part G: Give an example of a network, with all integral arc capacities having a unique maximum flow and more than one minimum cut. (3 nodes will be enough). Part H: Give an example of a network, with all integral arc capacities having at least two different maximum flows and at least two different minimum cuts. (3 nodes will be enough if you permit parallel arcs.) Problem 3: Eulerian Cycle Formulation: (21 Points, 7 Each) Consider the diagram below in which there are 10 rooms, each with walls. Your objective is to draw a continuous line that passes through each wall exactly once, where a wall is a maximum length straight line segment that does not intersect any different line segment. The line is neither permitted to trace back on itself nor go through any corner points. The line can cross itself. The solution below fails for four walls, each of which is in thick. Page 3 of 11
5 The upper thick wall has two lines going through it. The other three thick walls have no lines going through it. Part A: Explain how to convert this to a graph problem, in which the goal is to find an Eulerian path. Part B: Explain why there is no continuous line that goes through all walls exactly once. Part C: Show how to remove one of the walls of the original diagram (that is, remove a line segment) so that there is an Eulerian path in your graph after the wall is removed. (Removing the wall will lead to one fewer room in the original problem and one fewer node of your graph.) Also, give an Eulerian path. Problem : Retro A Problem from the Fall 2001 Exam (The Year Mike took the Class) (2 Points) Jim and Mike are playing a game of rummy in which the winning player scores either 31, 33, or 37 points per hand depending on the cards in the losing player s hand. After 20 rounds Mike has a score of 310. Part A: ( Points) What is the fewest number of hands that Mike could have won to have a score of exactly 310. (You can try solving this using trial and error, and use Excel if it helps. Part B: (16 Points) Express this problem as a shortest path problem (you do not have to solve it). Your network should have between 300 and 350 nodes. Be sure to explain what the nodes Page of 11
6 represent in the network, what the arcs are in the network, and what the costs are in the network. (HINT: it may help if you work with a problem with smaller numbers first. For example, suppose that the scores are either 2 or 3 and the Mike has a total score of 11. The fewest number of scores that Mike could get summing to 11 is four. Can you create a network with nodes labeled 0, 1, 2, 3,, 11 such that the shortest path from node 0 to node 11 corresponds to 3 scores of 3 and one score of 2?) Part C: ( Points) Explain why solving the shortest path problem for the network you created solves the problem. Problem : Maximum Flows Formulation (28 Points) Suppose Six Flags has the following water slide complex. The complex starts with a single tall tower and ends with the lagoon pool with palm trees at the bottom. Along the way there are intermediate pools, represented by the orange and yellow squares. Additionally, there are two types of slides in the tower: Green slides that take single tubes (that is, one rider at a time) Blue slides that take double tubes (that is, a pair of riders at a time) Page 5 of 11
7 TOWER POOL Every minute (that is, every time the second hand of a watch points to the 12) one person can start to go down a green slide and a pair can start down a blue slide. The slides themselves each take 5 seconds, which gives each person enough time to continue down the next slide at the start of the next minute. Note that it is OK for a pair to take a blue slide to an intermediate level and then split up and continue down on green slides (extra tubes are stored at the intermediate pools). Last, assume there is already a line 600 people long at the top of the tower (it s a very popular ride). The goal of the water park is to transport as many people as possible from the top to bottom (more people = more money!). Page 6 of 11
8 Part A: (12 Points) Formulate the problem of finding out how many people can be sent from the top of the complex to the lagoon pool in 5 min as a Maximum Flow problem. (Hint: Let the four locations be labeled T, L, R and B for the top, left, right, and bottom locations on the slide. Then create a time-space network with 2 nodes, where each node designates a location and time. The 2 nodes are T i, L i, R i, B i for i = 0 to 5. For example, T 0 represents the top of the tower at time 0, and R 5 represents the right intermediate pool after exactly 5 minutes. For each i = 0 to 5, draw an arc from T i to L i+1 which means that if you start at the top at minute i, you can go to the left at minute i+1. Since this is a blue slide, each of these arcs would have capacity 2. Continue drawing arcs in a similar manner for the other slides. You also need to add a single source node s with arcs directed to T 0 to T 5, and a single sink node t with arcs directed from B 0 to B 5. The goal is to get as much flow as possible from s to t.) All of the nodes and many of the arcs are on the network in Figure, which is on the next page. You can fill in the remaining arcs on this diagram, as well as label the capacities. Part B: ( Points) Solve your formulation using the Ford-Fulkerson algorithm. For each step, please list the current feasible flow and augmenting path selected. You do not need to redraw the residual network. Part D: ( Points) Suppose we are now interested in how many people can get down from the top in 10 minutes instead of 5 minutes. How many additional nodes would you need to represent this network? Page 7 of 11
9 Figure s T 0 T 1 T 2 T 3 T T L 0 L 1 L 2 L 3 L L 5 R 0 R 1 R 2 R 3 R R 5 B 0 B 1 B 2 B 3 B B 5 t Part E: (8 Points) Let v j be the max flow for the j minute problem. Without solving the problem or computing any of the vj s exactly for j > 6, which would you expect to be true? (i) v 10 = 2 v 5 or (ii) v 10 2 v 5 and possibly v 10 > 2 v 5 or (iii) v 10 2 v 5 and possibly v 10 < 2 v 5. Briefly justify your answer. HINT: If you want a general relationship involving v 2j and v j, note that v 3 is 0. Page 8 of 11
10 Problem 5: Min Cost Flow Formulation of Super Frogs (28 Points) Nooz and Ollie, being sly guys, decide to start a business selling stuffed super frogs to both Six Flags New England and Six Flags Great Adventure. They base their operation out of Seattle Washington. Nooz and Ollie have two production plants, one in San Mateo, CA and one in Bakersfield, CA, which each produce exactly 5000 frogs. The frogs are sent from the production plant to an inspection facility, in either Dallas or Houston. Assume each inspection facility has infinite capacity. From the inspection facility, frogs are shipped to the theme parks, where New England requires 3000 frogs and Great Adventure needs The shipping cost per frog between cities is shown in the table below. To From Dallas Houston 6 Flags NE 6 Flags GA San Mateo $1 $1 Bakersfield $ $1 Dallas $ $6 Houston $5 $3 Part A (8 Points): Formulate the problem of satisfying demand while minimizing total cost as a Min Cost Flow Problem Part B (8 Points): Write your formulation as a Linear Program For the remaining parts of this problem you will be making modifications to your above formulation. You DO NOT have to redraw the entire network for each part. Rather you should redraw the parts of the network that are modified from part A. We will assume the rest of the network remains how you drew it in part A. Part C (6 point): Suppose there is a cost for inspecting the frogs. The cost is $1 per frog in Houston and $2 per frog in Dallas. Modify your answer to part A to take into account this change. Part D (6 Points): Suppose the facility in Houston can inspect at most 2000 frogs; hence, only 2000 stuffed frogs can be sent to the plant. Modify your answer to part A to take into account this change. Page 9 of 11
11 Hey Ollie, I miss Turkey Tina You had your chance Tim, I will not play your wing man again Problem 6: Short Question Section (30 Points; 5 Each) Give a small example with each of the following characteristics. You may use parallel arcs (more than one arc from i to j), as it often it easier to come up with examples. When we say 3 nodes, we mean s, t and one other node. Part A: All arcs have different capacities, but there are at least two distinct minimum cuts. (3 nodes are sufficient.) Part B: We increase the capacity of each arc by 2 units, and the minimum cut changes. (3 nodes are enough if we permit parallel arcs. Part C. All capacities are odd, but the max flow is even. (2 nodes is enough if we permit parallel arcs). Part D. We increase the capacity of all arcs by 2, but the maximum flow increases by 3. (3 nodes are enough if we permit parallel arcs.). Part E. All arc capacities are integer values, but there is a maximum flow such that the flow on at least one of the arcs is fractional. (Note, there will also be an integer optimum flow.) (3 nodes are enough if parallel arcs are permitted.) Challenge Problem H: (10 Points) Consider a min cost flow problem where all cost coefficients are positive. Suppose we increase the supply at some source node and the demand at some sink node, while maintaining feasibility. Dakota Fanning claims that the value of the optimal cost will increase. Provide a counterexample to this claim. Page 10 of 11
Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011
Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011 Lecture 9 In which we introduce the maximum flow problem. 1 Flows in Networks Today we start talking about the Maximum Flow
More informationUnless stated otherwise, explain your logic and write out complete sentences. No notes, books, calculators, or other electronic devices are permitted.
Remarks: The final exam will be comprehensive. The questions on this practice final are roughly ordered according to when we learned about them; this will not be the case for the actual final. Certainly
More informationModeling, Analysis and Optimization of Networks. Alberto Ceselli
Modeling, Analysis and Optimization of Networks Alberto Ceselli alberto.ceselli@unimi.it Università degli Studi di Milano Dipartimento di Informatica Doctoral School in Computer Science A.A. 2015/2016
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
More informationProblem 1 (15 points: Graded by Shahin) Recall the network structure of our in-class trading experiment shown in Figure 1
Solutions for Homework 2 Networked Life, Fall 204 Prof Michael Kearns Due as hardcopy at the start of class, Tuesday December 9 Problem (5 points: Graded by Shahin) Recall the network structure of our
More informationECON 282 Final Practice Problems
ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How
More informationAlgorithms and Data Structures: Network Flows. 24th & 28th Oct, 2014
Algorithms and Data Structures: Network Flows 24th & 28th Oct, 2014 ADS: lects & 11 slide 1 24th & 28th Oct, 2014 Definition 1 A flow network consists of A directed graph G = (V, E). Flow Networks A capacity
More informationEcon 172A - Slides from Lecture 18
1 Econ 172A - Slides from Lecture 18 Joel Sobel December 4, 2012 2 Announcements 8-10 this evening (December 4) in York Hall 2262 I ll run a review session here (Solis 107) from 12:30-2 on Saturday. Quiz
More informationRMT 2015 Power Round Solutions February 14, 2015
Introduction Fair division is the process of dividing a set of goods among several people in a way that is fair. However, as alluded to in the comic above, what exactly we mean by fairness is deceptively
More informationGas Pipeline Construction
Gas Pipeline Construction The figure below shows 5 pipelines under consideration by a natural gas company to move gas from its 2 fields to its 2 storage areas. The numbers on the arcs show the number of
More informationTeam Round University of South Carolina Math Contest, 2018
Team Round University of South Carolina Math Contest, 2018 1. This is a team round. You have one hour to solve these problems as a team, and you should submit one set of answers for your team as a whole.
More informationThe tenure game. The tenure game. Winning strategies for the tenure game. Winning condition for the tenure game
The tenure game The tenure game is played by two players Alice and Bob. Initially, finitely many tokens are placed at positions that are nonzero natural numbers. Then Alice and Bob alternate in their moves
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 15.053 Introduction to Optimization (Spring 2005) Problem Set 4, Due March 8 th, 2005 You will need 88 points out of 111 to receive a grade of 2.5. Note you have 1.5
More informationUMBC 671 Midterm Exam 19 October 2009
Name: 0 1 2 3 4 5 6 total 0 20 25 30 30 25 20 150 UMBC 671 Midterm Exam 19 October 2009 Write all of your answers on this exam, which is closed book and consists of six problems, summing to 160 points.
More informationBest of luck on the exam!
CS103 Handout 18 Fall 2014 October 20, 2014 Practice Midterm Exam This practice exam is closed-book and closed-computer but open-note. You may have a doublesided, 8.5 11 sheet of notes with you when you
More informationFinal Practice Problems: Dynamic Programming and Max Flow Problems (I) Dynamic Programming Practice Problems
Final Practice Problems: Dynamic Programming and Max Flow Problems (I) Dynamic Programming Practice Problems To prepare for the final first of all study carefully all examples of Dynamic Programming which
More information2009 Leap Frog Relay Grades 6-8 Part I Solutions
2009 Leap Frog Relay Grades 6-8 Part I Solutions No calculators allowed Correct answer = 4, Incorrect answer =, Blank = 0. How many angles are there in the figure? (a) 4 (b) 6 (c) 7 (d) 8 (e) More than
More informationIntroduction to Spring 2009 Artificial Intelligence Final Exam
CS 188 Introduction to Spring 2009 Artificial Intelligence Final Exam INSTRUCTIONS You have 3 hours. The exam is closed book, closed notes except a two-page crib sheet, double-sided. Please use non-programmable
More informationCheckpoint Questions Due Monday, October 7 at 2:15 PM Remaining Questions Due Friday, October 11 at 2:15 PM
CS13 Handout 8 Fall 13 October 4, 13 Problem Set This second problem set is all about induction and the sheer breadth of applications it entails. By the time you're done with this problem set, you will
More informationGame Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness
Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness March 1, 2011 Summary: We introduce the notion of a (weakly) dominant strategy: one which is always a best response, no matter what
More informationCSE 312 Midterm Exam May 7, 2014
Name: CSE 312 Midterm Exam May 7, 2014 Instructions: You have 50 minutes to complete the exam. Feel free to ask for clarification if something is unclear. Please do not turn the page until you are instructed
More informationMidterm Examination. CSCI 561: Artificial Intelligence
Midterm Examination CSCI 561: Artificial Intelligence October 10, 2002 Instructions: 1. Date: 10/10/2002 from 11:00am 12:20 pm 2. Maximum credits/points for this midterm: 100 points (corresponding to 35%
More informationDijkstra s Algorithm (5/9/2013)
Dijkstra s Algorithm (5/9/2013) www.alevelmathsng.co.uk (Shortest Path Problem) The aim is to find the shortest path between two specified nodes. The idea with this algorithm is to attach to each node
More informationQuestion Score Max Cover Total 149
CS170 Final Examination 16 May 20 NAME (1 pt): TA (1 pt): Name of Neighbor to your left (1 pt): Name of Neighbor to your right (1 pt): This is a closed book, closed calculator, closed computer, closed
More information39 th JUNIOR HIGH SCHOOL MATHEMATICS CONTEST APRIL 29, 2015
THE CALGARY MATHEMATICAL ASSOCIATION 39 th JUNIOR HIGH SCHOOL MATHEMATICS CONTEST APRIL 29, 2015 NAME: GENDER: PLEASE PRINT (First name Last name) (optional) SCHOOL: GRADE: (9,8,7,... ) You have 90 minutes
More information37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game
37 Game Theory Game theory is one of the most interesting topics of discrete mathematics. The principal theorem of game theory is sublime and wonderful. We will merely assume this theorem and use it to
More informationCS 32 Puzzles, Games & Algorithms Fall 2013
CS 32 Puzzles, Games & Algorithms Fall 2013 Study Guide & Scavenger Hunt #2 November 10, 2014 These problems are chosen to help prepare you for the second midterm exam, scheduled for Friday, November 14,
More informationBMT 2018 Combinatorics Test Solutions March 18, 2018
. Bob has 3 different fountain pens and different ink colors. How many ways can he fill his fountain pens with ink if he can only put one ink in each pen? Answer: 0 Solution: He has options to fill his
More informationIndividual 5 th Grade
Individual 5 th Grade Instructions: Problems 1 10 are multiple choice and count towards your team score. Bubble in the letter on your answer sheet. Be sure to erase all mistakes completely. 1. Which one
More informationGame Playing Part 1 Minimax Search
Game Playing Part 1 Minimax Search Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [based on slides from A. Moore http://www.cs.cmu.edu/~awm/tutorials, C.
More informationCrossing Game Strategies
Crossing Game Strategies Chloe Avery, Xiaoyu Qiao, Talon Stark, Jerry Luo March 5, 2015 1 Strategies for Specific Knots The following are a couple of crossing game boards for which we have found which
More information40 th JUNIOR HIGH SCHOOL MATHEMATICS CONTEST MAY 4, 2016
THE CALGARY MATHEMATICAL ASSOCIATION 40 th JUNIOR HIGH SCHOOL MATHEMATICS CONTEST MAY 4, 2016 NAME: PLEASE PRINT (First name Last name) GENDER: SCHOOL: GRADE: (9,8,7,...) You have 90 minutes for the examination.
More informationMidterm 2 6:00-8:00pm, 16 April
CS70 2 Discrete Mathematics and Probability Theory, Spring 2009 Midterm 2 6:00-8:00pm, 16 April Notes: There are five questions on this midterm. Answer each question part in the space below it, using the
More informationUNIVERSITY of PENNSYLVANIA CIS 391/521: Fundamentals of AI Midterm 1, Spring 2010
UNIVERSITY of PENNSYLVANIA CIS 391/521: Fundamentals of AI Midterm 1, Spring 2010 Question Points 1 Environments /2 2 Python /18 3 Local and Heuristic Search /35 4 Adversarial Search /20 5 Constraint Satisfaction
More informationGrade 6 Math Circles Combinatorial Games November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games November 3/4, 2015 Chomp Chomp is a simple 2-player game. There
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationChapter 4 Number Theory
Chapter 4 Number Theory Throughout the study of numbers, students Á should identify classes of numbers and examine their properties. For example, integers that are divisible by 2 are called even numbers
More informationTable of Contents. Table of Contents 1
Table of Contents 1) The Factor Game a) Investigation b) Rules c) Game Boards d) Game Table- Possible First Moves 2) Toying with Tiles a) Introduction b) Tiles 1-10 c) Tiles 11-16 d) Tiles 17-20 e) Tiles
More informationProbability and Counting Techniques
Probability and Counting Techniques Diana Pell (Multiplication Principle) Suppose that a task consists of t choices performed consecutively. Suppose that choice 1 can be performed in m 1 ways; for each
More informationDIGITAL DESIGN WITH SM CHARTS
DIGITAL DESIGN WITH SM CHARTS By: Dr K S Gurumurthy, UVCE, Bangalore e-notes for the lectures VTU EDUSAT Programme Dr. K S Gurumurthy, UVCE, Blore Page 1 19/04/2005 DIGITAL DESIGN WITH SM CHARTS The utility
More informationNRP Math Challenge Club
Week 7 : Manic Math Medley 1. You have exactly $4.40 (440 ) in quarters (25 coins), dimes (10 coins), and nickels (5 coins). You have the same number of each type of coin. How many dimes do you have? 2.
More informationCutting a Pie Is Not a Piece of Cake
Cutting a Pie Is Not a Piece of Cake Julius B. Barbanel Department of Mathematics Union College Schenectady, NY 12308 barbanej@union.edu Steven J. Brams Department of Politics New York University New York,
More informationGrade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015 Chomp Chomp is a simple 2-player
More informationCS188 Spring 2010 Section 3: Game Trees
CS188 Spring 2010 Section 3: Game Trees 1 Warm-Up: Column-Row You have a 3x3 matrix of values like the one below. In a somewhat boring game, player A first selects a row, and then player B selects a column.
More informationThe 2016 ACM-ICPC Asia China-Final Contest Problems
Problems Problem A. Number Theory Problem.... 1 Problem B. Hemi Palindrome........ 2 Problem C. Mr. Panda and Strips...... Problem D. Ice Cream Tower........ 5 Problem E. Bet............... 6 Problem F.
More informationDirections: Show all of your work. Use units and labels and remember to give complete answers.
AMS II QTR 4 FINAL EXAM REVIEW TRIANGLES/PROBABILITY/UNIT CIRCLE/POLYNOMIALS NAME HOUR This packet will be collected on the day of your final exam. Seniors will turn it in on Friday June 1 st and Juniors
More informationAssignment Problem. Introduction. Formulation of an assignment problem
Assignment Problem Introduction The assignment problem is a special type of transportation problem, where the objective is to minimize the cost or time of completing a number of jobs by a number of persons.
More informationCS188: Artificial Intelligence, Fall 2011 Written 2: Games and MDP s
CS88: Artificial Intelligence, Fall 20 Written 2: Games and MDP s Due: 0/5 submitted electronically by :59pm (no slip days) Policy: Can be solved in groups (acknowledge collaborators) but must be written
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing May 8, 2017 May 8, 2017 1 / 15 Extensive Form: Overview We have been studying the strategic form of a game: we considered only a player s overall strategy,
More informationPUTNAM PROBLEMS FINITE MATHEMATICS, COMBINATORICS
PUTNAM PROBLEMS FINITE MATHEMATICS, COMBINATORICS 2014-B-5. In the 75th Annual Putnam Games, participants compete at mathematical games. Patniss and Keeta play a game in which they take turns choosing
More informationPartial Answers to the 2005 Final Exam
Partial Answers to the 2005 Final Exam Econ 159a/MGT522a Ben Polak Fall 2007 PLEASE NOTE: THESE ARE ROUGH ANSWERS. I WROTE THEM QUICKLY SO I AM CAN'T PROMISE THEY ARE RIGHT! SOMETIMES I HAVE WRIT- TEN
More informationGeorge Fox University H.S. Programming Contest Division - I 2018
General Notes George Fox University H.S. Programming Contest Division - I 2018 1. Do the problems in any order you like. They do not have to be done in order (hint: the easiest problem may not be the first
More informationOrganization Team Team ID# If each of the congruent figures has area 1, what is the area of the square?
1. [4] A square can be divided into four congruent figures as shown: If each of the congruent figures has area 1, what is the area of the square? 2. [4] John has a 1 liter bottle of pure orange juice.
More informationCoding for Efficiency
Let s suppose that, over some channel, we want to transmit text containing only 4 symbols, a, b, c, and d. Further, let s suppose they have a probability of occurrence in any block of text we send as follows
More informationCS 787: Advanced Algorithms Homework 1
CS 787: Advanced Algorithms Homework 1 Out: 02/08/13 Due: 03/01/13 Guidelines This homework consists of a few exercises followed by some problems. The exercises are meant for your practice only, and do
More informationIdeas beyond Number. Activity worksheets
Ideas beyond Number Activity sheet 1 Task 1 Some students started to solve this equation in different ways: For each statement tick True or False: = = = = Task 2: Counter-examples The exception disproves
More informationFinite Mathematical Structures A
AMS 01. (Spring, 010) Estie Arkin Finite Mathematical Structures A Exam : Thursday, April 8, 010 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain that you have
More information2013 Mid-Atlantic Regional Programming Contest
2013 Mid-Atlantic Regional Programming Contest This is a courtesy copy of the problem set for the Mid-Atlantic Regional contest. It is an abbreviated version of the problem set provided to the teams. Omitted
More informationProblem 1. (15 points) Consider the so-called Cryptarithmetic problem shown below.
ECS 170 - Intro to Artificial Intelligence Suggested Solutions Mid-term Examination (100 points) Open textbook and open notes only Show your work clearly Winter 2003 Problem 1. (15 points) Consider the
More informationState Math Contest 2018 Junior Exam
State Math Contest 2018 Junior Exam Weber State University March 8, 2018 Instructions: Do not turn this page until your proctor tells you. Enter your name, grade, and school information following the instructions
More information6.042/18.062J Mathematics for Computer Science December 17, 2008 Tom Leighton and Marten van Dijk. Final Exam
6.042/18.062J Mathematics for Computer Science December 17, 2008 Tom Leighton and Marten van Dijk Final Exam Problem 1. [25 points] The Final Breakdown Suppose the 6.042 final consists of: 36 true/false
More informationExperiments on Alternatives to Minimax
Experiments on Alternatives to Minimax Dana Nau University of Maryland Paul Purdom Indiana University April 23, 1993 Chun-Hung Tzeng Ball State University Abstract In the field of Artificial Intelligence,
More informationYour written assignment is to complete the written practice for lessons 5, 10, and 14. You will find those questions on the following pages.
Math Saxon Course 3 Summer Packet To prepare for your 8 th grade math course you need to watch the 8 videos listed on the ACE website. Please make sure that you watch them carefully and fully understand
More informationSection Marks Agents / 8. Search / 10. Games / 13. Logic / 15. Total / 46
Name: CS 331 Midterm Spring 2017 You have 50 minutes to complete this midterm. You are only allowed to use your textbook, your notes, your assignments and solutions to those assignments during this midterm.
More informationCPSC 217 Assignment 3
CPSC 217 Assignment 3 Due: Friday November 24, 2017 at 11:55pm Weight: 7% Sample Solution Length: Less than 100 lines, including blank lines and some comments (not including the provided code) Individual
More information9694 THINKING SKILLS
CAMBRIDGE INTERNATIONAL EXAMINATIONS Cambridge International Advanced Level MARK SCHEME for the October/November 2015 series 9694 THINKING SKILLS 9694/31 Paper 3 (Problem Analysis and Solution), maximum
More informationCS188 Spring 2010 Section 3: Game Trees
CS188 Spring 2010 Section 3: Game Trees 1 Warm-Up: Column-Row You have a 3x3 matrix of values like the one below. In a somewhat boring game, player A first selects a row, and then player B selects a column.
More informationWeek 6: Advance applications of the PIE. 17 and 19 of October, 2018
(1/22) MA284 : Discrete Mathematics Week 6: Advance applications of the PIE http://www.maths.nuigalway.ie/ niall/ma284 17 and 19 of October, 2018 1 Stars and bars 2 Non-negative integer inequalities 3
More informationb. How would you model your equation on a number line to show your answer?
Exercise 1: Real-World Introduction to Integer Addition Answer the questions below. a. Suppose you received $10 from your grandmother for your birthday. You spent $4 on snacks. Using addition, how would
More informationmywbut.com Two agent games : alpha beta pruning
Two agent games : alpha beta pruning 1 3.5 Alpha-Beta Pruning ALPHA-BETA pruning is a method that reduces the number of nodes explored in Minimax strategy. It reduces the time required for the search and
More informationProblem Set 2. Counting
Problem Set 2. Counting 1. (Blitzstein: 1, Q3 Fred is planning to go out to dinner each night of a certain week, Monday through Friday, with each dinner being at one of his favorite ten restaurants. i
More informationn r for the number. (n r)!r!
Throughout we use both the notations ( ) n r and C n n! r for the number (n r)!r! 1 Ten points are distributed around a circle How many triangles have all three of their vertices in this 10-element set?
More informationExercises and Problems 1.1
Section 1.1 Introduction to Problem Solving 1.13 13 echnology Connection What is the least number of moves to transfer four disks from one tower to another if only one disk can be moved at a time and a
More informationMathematics Competition Practice Session 6. Hagerstown Community College: STEM Club November 20, :00 pm - 1:00 pm STC-170
2015-2016 Mathematics Competition Practice Session 6 Hagerstown Community College: STEM Club November 20, 2015 12:00 pm - 1:00 pm STC-170 1 Warm-Up (2006 AMC 10B No. 17): Bob and Alice each have a bag
More informationOutcome 7 Review. *Recall that -1 (-5) means
Outcome 7 Review Level 2 Determine the slope of a line that passes through A(3, -5) and B(-2, -1). Step 1: Remember that ordered pairs are in the form (x, y). Label the points so you can substitute into
More informationWeek 1. 1 What Is Combinatorics?
1 What Is Combinatorics? Week 1 The question that what is combinatorics is similar to the question that what is mathematics. If we say that mathematics is about the study of numbers and figures, then combinatorics
More informationAlgebra/Geometry Session Problems Questions 1-20 multiple choice
lgebra/geometry Session Problems Questions 1-0 multiple choice nswer only one choice: (a), (b), (c), (d), or (e) for each of the following questions. Only use a number pencil. Make heavy black marks that
More informationDynamic Programming. Objective
Dynamic Programming Richard de Neufville Professor of Engineering Systems and of Civil and Environmental Engineering MIT Massachusetts Institute of Technology Dynamic Programming Slide 1 of 43 Objective
More informationCS 540: Introduction to Artificial Intelligence
CS 540: Introduction to Artificial Intelligence Mid Exam: 7:15-9:15 pm, October 25, 2000 Room 1240 CS & Stats CLOSED BOOK (one sheet of notes and a calculator allowed) Write your answers on these pages
More informationGrade 7/8 Math Circles Game Theory October 27/28, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Game Theory October 27/28, 2015 Chomp Chomp is a simple 2-player game. There is
More informationFinal Exam, Math 6105
Final Exam, Math 6105 SWIM, June 29, 2006 Your name Throughout this test you must show your work. 1. Base 5 arithmetic (a) Construct the addition and multiplication table for the base five digits. (b)
More informationExpected Value, continued
Expected Value, continued Data from Tuesday On Tuesday each person rolled a die until obtaining each number at least once, and counted the number of rolls it took. Each person did this twice. The data
More information4th Bay Area Mathematical Olympiad
2002 4th ay Area Mathematical Olympiad February 26, 2002 The time limit for this exam is 4 hours. Your solutions should be clearly written arguments. Merely stating an answer without any justification
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting The Final Challenge Part One Solutions Whenever the question asks for a probability, enter your answer as either 0, 1, or the sum of the numerator and denominator
More informationCardinality and Bijections
Countable and Cardinality and Bijections Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 13, 2012 Countable and Countable and Countable and How to count elements in a set? How
More informationCS 540-2: Introduction to Artificial Intelligence Homework Assignment #2. Assigned: Monday, February 6 Due: Saturday, February 18
CS 540-2: Introduction to Artificial Intelligence Homework Assignment #2 Assigned: Monday, February 6 Due: Saturday, February 18 Hand-In Instructions This assignment includes written problems and programming
More informationCMPUT 396 Tic-Tac-Toe Game
CMPUT 396 Tic-Tac-Toe Game Recall minimax: - For a game tree, we find the root minimax from leaf values - With minimax we can always determine the score and can use a bottom-up approach Why use minimax?
More informationON SPLITTING UP PILES OF STONES
ON SPLITTING UP PILES OF STONES GREGORY IGUSA Abstract. In this paper, I describe the rules of a game, and give a complete description of when the game can be won, and when it cannot be won. The first
More informationIn this section, you will learn the basic trigonometric identities and how to use them to prove other identities.
4.6 Trigonometric Identities Solutions to equations that arise from real-world problems sometimes include trigonometric terms. One example is a trajectory problem. If a volleyball player serves a ball
More informationMITOCW R22. Dynamic Programming: Dance Dance Revolution
MITOCW R22. Dynamic Programming: Dance Dance Revolution The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational
More informationThe US Chess Rating system
The US Chess Rating system Mark E. Glickman Harvard University Thomas Doan Estima April 24, 2017 The following algorithm is the procedure to rate US Chess events. The procedure applies to five separate
More informationCS188 Spring 2014 Section 3: Games
CS188 Spring 2014 Section 3: Games 1 Nearly Zero Sum Games The standard Minimax algorithm calculates worst-case values in a zero-sum two player game, i.e. a game in which for all terminal states s, the
More information2359 (i.e. 11:59:00 pm) on 4/16/18 via Blackboard
CS 109: Introduction to Computer Science Goodney Spring 2018 Homework Assignment 4 Assigned: 4/2/18 via Blackboard Due: 2359 (i.e. 11:59:00 pm) on 4/16/18 via Blackboard Notes: a. This is the fourth homework
More information1. The masses, x grams, of the contents of 25 tins of Brand A anchovies are summarized by x =
P6.C1_C2.E1.Representation of Data and Probability 1. The masses, x grams, of the contents of 25 tins of Brand A anchovies are summarized by x = 1268.2 and x 2 = 64585.16. Find the mean and variance of
More informationProblem Set 4 Due: Wednesday, November 12th, 2014
6.890: Algorithmic Lower Bounds Prof. Erik Demaine Fall 2014 Problem Set 4 Due: Wednesday, November 12th, 2014 Problem 1. Given a graph G = (V, E), a connected dominating set D V is a set of vertices such
More information( ) = A. 2. Write the following sets using the roster method. 3. Write the following sets using set-builder notation.
2.6. EXERISES 1. True or False? a. The empty set has no subsets. b. No set has exactly 14 distinct subsets. c. For any two finite sets and,
More informationSearch then involves moving from state-to-state in the problem space to find a goal (or to terminate without finding a goal).
Search Can often solve a problem using search. Two requirements to use search: Goal Formulation. Need goals to limit search and allow termination. Problem formulation. Compact representation of problem
More informationNetwork-building. Introduction. Page 1 of 6
Page of 6 CS 684: Algorithmic Game Theory Friday, March 2, 2004 Instructor: Eva Tardos Guest Lecturer: Tom Wexler (wexler at cs dot cornell dot edu) Scribe: Richard C. Yeh Network-building This lecture
More informationProblem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.)
Problem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.) Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number
More informationPearson Edexcel GCE Decision Mathematics D2. Advanced/Advanced Subsidiary
Pearson Edexcel GCE Decision Mathematics D2 Advanced/Advanced Subsidiary Wednesday 29 June 2016 Morning Time: 1 hour 30 minutes Paper Reference 6690/01 You must have: D2 Answer Book Candidates may use
More information