{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/effectiveness-of-greedily-collecting-items-in","title":"Effectiveness of greedily collecting items in open world games","arxiv_id":"1608.06175","date":"2016-08-17","proceeding":null,"authors":["Andrej Gajduk"],"abstract":"Since Pokemon Go sent millions on the quest of collecting virtual monsters,\nan important question has been on the minds of many people: Is going after the\nclosest item first a time-and-cost-effective way to play? Here, we show that\nthis is in fact a good strategy which performs on average only 7% worse than\nthe best possible solution in terms of the total distance traveled to gather\nall the items. Even when accounting for errors due to the inability of people\nto accurately measure distances by eye, the performance only goes down to 16%\nof the optimal solution.","url_abs":"http://arxiv.org/abs/1608.06175v1","url_pdf":"http://arxiv.org/pdf/1608.06175v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"effectiveness-of-greedily-collecting-items-in","repo_url":"https://github.com/gajduk/greedy-tsp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}