Skip to content

Latest commit

 

History

History

Baseball Elimination

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

Programming Assignment 3: Baseball Elimination

Assignment Specification

The baseball elimination problem. In the baseball elimination problem, there is a division consisting of n teams. At some point during the season, team i has w[i] wins, l[i] losses, r[i] remaining games, and g[i][j] games left to play against team j. A team is mathematically eliminated if it cannot possibly finish the season in (or tied for) first place. The goal is to determine exactly which teams are mathematically eliminated. For simplicity, we assume that no games end in a tie (as is the case in Major League Baseball) and that there are no rainouts (i.e., every scheduled game is played).