Pokemon Go and the Traveling Salesman Problem
Blog: Decision Management Community
These days you may have heard stories of people hunting down Pokémon on their office desks, in hospital rooms, and even in bathrooms. Do you want to catch them all? As quickly as possible? There is a math model for that called the Traveling Salesman Problem (TCP). There are plenty of supposting tools that may check every possible route to pick out the shortest one. Read more
Leave a Comment
You must be logged in to post a comment.