While it’s obvious that math is in all video games, between pixel designs and character stats, it’s also used when finding the best way to grab all of those pesky yet useful hidden items around a game map. While reading this link: https://arxiv.org/pdf/1608.06175.pdf, the Traveling Salesman Problem algorithm was found to be the best way to help players attain items that are scattered around games such as Pokemon, Legend of Zelda, and the game that was used in the experiment done in the article, Far Cry 3. Through using the algorithm, the best routes can be found, either based on time or distance, while also taking into account cut-scenes, obstacles such as drop-offs and climbing, and more video-game attributes that may get int the way of finding the fastest paths.
I found this to be really interesting, even if I’m not one for going on item hauls when I play video games. There are many people called “speed players” who are dedicated to cutting every corner to find the fastest ways to play their favorite games. Knowing just how rapid-fire the play, going into the minutes-range rather than finishing games in hours, they most likely use this algorithm to perfect their strategy. For anyone who likes to play on their XBox or Nintendo DS, do your math!