Title
Maximizing Mickey Mouse
Department, Center, or Institute
Mathematics
Presentation Format
Poster
Presentation Type
Course project
Description
Mickey Mouse draws crowds from all across the world to Walt Disney World, and the desire to meet him results in long wait times.To minimize these times, we would like to see how many friends of Mickey (people in Mickey Mouse costumes) we can place throughout the Magic Kingdom theme park. Since the experience of meeting Mickey Mouse becomes devalued if a visitor sees two Mickey characters at the same time, we want to avoid this situation. We use a graph theory approach to determine the maximum number of Mickeys and their locations in the Magic Kingdom under the condition that no two Mickeys can be seen at once.
Session Number
5
Start Date and Time
4-9-2019 4:00 PM
Location
PAC Gym
Recommended Citation
Hartley, Andrew; Ruffle, Lois; and Weeks, Ashley, "Maximizing Mickey Mouse" (2019). Furman Engaged!. 130.
https://scholarexchange.furman.edu/furmanengaged/2019/all/130
Maximizing Mickey Mouse
PAC Gym
Mickey Mouse draws crowds from all across the world to Walt Disney World, and the desire to meet him results in long wait times.To minimize these times, we would like to see how many friends of Mickey (people in Mickey Mouse costumes) we can place throughout the Magic Kingdom theme park. Since the experience of meeting Mickey Mouse becomes devalued if a visitor sees two Mickey characters at the same time, we want to avoid this situation. We use a graph theory approach to determine the maximum number of Mickeys and their locations in the Magic Kingdom under the condition that no two Mickeys can be seen at once.