• Login
    View Item 
    •   DSpace Home
    • Student Scholarship
    • Mathematics Department
    • Senior Theses
    • 2012-2013
    • View Item
    •   DSpace Home
    • Student Scholarship
    • Mathematics Department
    • Senior Theses
    • 2012-2013
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    The Ultimate Lineup

    Thumbnail
    View/Open
    Math_Senior_Thesis-_The_Ultimate_Lineup.pdf (295.7Kb)
    Date
    2013-10-24
    Author
    Kelterborn, Chad
    Metadata
     Show full item record
    Subjects
    Baseball; batting order
    Abstract
    We explore the optimization of a youth baseball teams batting order, considering each players individual statistics. Specifically, we wanted to see if an alternating batting order of walkers and hitters (e.g. Highest Walk Average, Highest Batting Average, Second Highest Walk Average) would be a better lineup than the conventional batting order by descending batting average. For our calculations, we take into account each individual's Hit Average, On-base Percentage, Walk Average and Strike-out Average. From our simulations, we found that an alternating lineup produces fewer runs at 7.7913 runs per game than a descending lineup which produces 7.9716 runs per game. Although the descending lineup was found to be better than 99% of all possible lineups, our simulation found that the lineups that scored more runs per game on average than the descending lineup shared certain characteristics in the ordering of the lineup.
    Collections
    • 2012-2013

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Carthage College © 2015-2022
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV