{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:18:05Z","timestamp":1742912285231,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031024610"},{"type":"electronic","value":"9783031024627"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-02462-7_30","type":"book-chapter","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T23:02:49Z","timestamp":1649977369000},"page":"471-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automating Speedrun Routing: Overview and Vision"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2711-6938","authenticated-orcid":false,"given":"Matthias","family":"Gro\u00df","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3751-5887","authenticated-orcid":false,"given":"Dietlind","family":"Z\u00fchlke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8969-4795","authenticated-orcid":false,"given":"Boris","family":"Naujoks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,15]]},"reference":[{"key":"30_CR1","unstructured":"GDQ Tracker - Event List. https:\/\/gamesdonequick.com\/tracker\/events\/. Accessed 6 Feb 2022"},{"key":"30_CR2","unstructured":"GDQStat.us. https:\/\/gdqstat.us\/previous-events\/agdq-2020\/?series=0. Accessed 6 Feb 2022"},{"key":"30_CR3","unstructured":"Reverse Bottle Adventure - ZeldaSpeedRuns. https:\/\/www.zeldaspeedruns.com\/oot\/ba\/reverse-bottle-adventure. Accessed 6 Feb 2022"},{"key":"30_CR4","unstructured":"speedrun.com. https:\/\/www.speedrun.com\/oot. Accessed 6 Feb 2022"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/4235.585888","volume":"1","author":"T B\u00e4ck","year":"1997","unstructured":"B\u00e4ck, T., Hammel, U., Schwefel, H.P.: Evolutionary computation: comments on the history and current state. IEEE Trans. Evol. Comput. 1(1), 3\u201317 (1997). https:\/\/doi.org\/10.1109\/4235.585888","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR6","unstructured":"Coello, C.A.C., Lamont, G.B., van Veldhuizen, D.A.: Applications Of Multi-Objective Evolutionary Algorithms. World Scientific Press, Singapore. 2. edn. (2007)"},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF00354588","volume":"50","author":"G Currie","year":"1986","unstructured":"Currie, G.: Fictional truth. Philos. Stud. 50(2), 195\u2013212 (1986). https:\/\/doi.org\/10.1007\/BF00354588","journal-title":"Philos. Stud."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"De Jong, K.A.: Evolutionary Computation: A Unified Approach. MIT Press, Cambridge (2016)","DOI":"10.1145\/3067695.3067715"},{"key":"30_CR9","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Hoboken (2001)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"30_CR11","doi-asserted-by":"publisher","unstructured":"Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Congress on Evolutionary Computation (CEC99), vol. 2, pp. 1470\u20131477 (1999). https:\/\/doi.org\/10.1109\/CEC.1999.782657","DOI":"10.1109\/CEC.1999.782657"},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"30_CR13","doi-asserted-by":"publisher","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, 2nd edn. (2005). https:\/\/doi.org\/10.1007\/3-540-27659-9","DOI":"10.1007\/3-540-27659-9"},{"key":"30_CR14","doi-asserted-by":"publisher","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series. Springer, 2. edn. (2015). https:\/\/doi.org\/10.1007\/978-3-662-44874-8","DOI":"10.1007\/978-3-662-44874-8"},{"key":"30_CR15","doi-asserted-by":"publisher","unstructured":"Ford, D.: Speedrunning: transgressive play in digital space. In: Nordic DiGRA 2018 (2018). https:\/\/doi.org\/10.13140\/RG.2.2.12357.91369","DOI":"10.13140\/RG.2.2.12357.91369"},{"key":"30_CR16","doi-asserted-by":"publisher","unstructured":"Gendreau, M., Potvin, J.Y., et al.: Handbook of Metaheuristics, vol. 3. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4","DOI":"10.1007\/978-3-319-91086-4"},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968). https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"1","key":"30_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.5325\/jpoststud.4.1.0005","volume":"4","author":"J Hay","year":"2020","unstructured":"Hay, J.: Fully optimized: the (Post)human art of Speedrunning. J. Posthuman Stud. 4(1), 5\u201324 (2020). https:\/\/doi.org\/10.5325\/jpoststud.4.1.0005","journal-title":"J. Posthuman Stud."},{"key":"30_CR19","doi-asserted-by":"publisher","unstructured":"Hemmingsen, M.: Code is law: subversion and collective knowledge in the ethos of video game speedrunning. Sport, Ethics Philos. 1\u201326 (2020). https:\/\/doi.org\/10.1080\/17511321.2020.1796773","DOI":"10.1080\/17511321.2020.1796773"},{"key":"30_CR20","doi-asserted-by":"publisher","unstructured":"Huang, S., Bamford, C., Ontanon, S., Grela, L.: Gym-$$\\upmu $$RTS: toward affordable full game real-time strategy games research with deep reinforcement learning. In: IEEE Conference on Games (CIG) (2021). https:\/\/doi.org\/10.13140\/RG.2.2.18639.82081","DOI":"10.13140\/RG.2.2.18639.82081"},{"key":"30_CR21","unstructured":"I\u0161kovs, A.: Travelling murderer problem: planning a morrowind all-faction speedrun with simulated annealing (2018). https:\/\/www.kimonote.com\/@mildbyte\/travelling-murderer-problem-planning-a-morrowind-all-faction-speedrun-with-simulated-annealing-part-1-41079\/. Accessed 6 Feb 2022"},{"key":"30_CR22","unstructured":"JstAnothrVirtuoso: Finding the Optimum Nadeo Cut... With Science!! (2019). https:\/\/www.youtube.com\/watch?v=1ZsAjvO9E1g. Accessed 6 Feb 2022"},{"key":"30_CR23","doi-asserted-by":"publisher","unstructured":"Lafond, M.: The complexity of speedrunning video games. In: Ito, H., Leonardi, S., Pagli, L., Prencipe, G. (eds.) Fun with Algorithms (FUN), vol. 100, pp. 27:1\u201327:19. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2018.27","DOI":"10.4230\/LIPIcs.FUN.2018.27"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Lample, G., Chaplot, D.S.: Playing FPS games with deep reinforcement learning. CoRR (2016). http:\/\/arxiv.org\/abs\/1609.05521","DOI":"10.1609\/aaai.v31i1.10827"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer (1999)","DOI":"10.1007\/978-1-4615-5563-6"},{"issue":"7","key":"30_CR26","doi-asserted-by":"publisher","first-page":"4921","DOI":"10.1016\/j.eswa.2009.12.023","volume":"37","author":"JA Mocholi","year":"2010","unstructured":"Mocholi, J.A., Jaen, J., Catala, A., Navarro, E.: An emotionally biased ant colony algorithm for pathfinding in games. Expert Syst. Appl. 37(7), 4921\u20134927 (2010). https:\/\/doi.org\/10.1016\/j.eswa.2009.12.023","journal-title":"Expert Syst. Appl."},{"key":"30_CR27","doi-asserted-by":"publisher","DOI":"10.4324\/9780203892619","volume-title":"Playing with Videogames","author":"J Newman","year":"2008","unstructured":"Newman, J.: Playing with Videogames. Routledge, London (2008)"},{"key":"30_CR28","doi-asserted-by":"publisher","unstructured":"Newman, J.: Wrong warping, sequence breaking, and running through code. J. Jpn Assoc. Digital Humanit. 4(1), 7\u201336 (2019). https:\/\/doi.org\/10.17928\/jjadh.4.1_7","DOI":"10.17928\/jjadh.4.1_7"},{"issue":"12","key":"30_CR29","doi-asserted-by":"publisher","first-page":"5056","DOI":"10.1016\/j.eswa.2015.02.046","volume":"42","author":"M Rajabi-Bahaabadi","year":"2015","unstructured":"Rajabi-Bahaabadi, M., Shariat-Mohaymany, A., Babaei, M., Ahn, C.W.: Multi-objective path finding in stochastic time-dependent road networks using non-dominated sorting genetic algorithm. Expert Syst. Appl. 42(12), 5056\u20135064 (2015). https:\/\/doi.org\/10.1016\/j.eswa.2015.02.046","journal-title":"Expert Syst. Appl."},{"key":"30_CR30","unstructured":"Ricksand, M.: \u201cTwere well it were done quickly\u201d: what belongs in a glitchless speedrun? Game Stud. 21(1) (2021). http:\/\/gamestudies.org\/2101\/articles\/ricksand. Accessed 6 Feb 2022"},{"issue":"3","key":"30_CR31","doi-asserted-by":"publisher","first-page":"416","DOI":"10.7763\/IJCTE.2010.V2.178","volume":"2","author":"V Rishiwal","year":"2010","unstructured":"Rishiwal, V., Yadav, M., Arya, K.V.: Finding optimal paths on terrain maps using ant colony algorithm. Int. J. Comput. Theory Eng. 2(3), 416\u2013419 (2010). https:\/\/doi.org\/10.7763\/IJCTE.2010.V2.178","journal-title":"Int. J. Comput. Theory Eng."},{"key":"30_CR32","unstructured":"Scully-Blaker, R.: A practiced practice: speedrunning through space with de Certeau and Virilio. Game Stud. 14(1) (2014). http:\/\/gamestudies.org\/1401\/articles\/scullyblaker. Accessed 6 Feb 2022"},{"key":"30_CR33","unstructured":"Scully-Blaker, R.: Re-Curating the Accident: Speedrunning as Community and Practice. Masters thesis, Concordia University (2016)"},{"key":"30_CR34","unstructured":"Scully-Blaker, R.: The Speedrunning museum of accidents. Kinephanos (Preserving Play, Special Issue), 71\u201388 (2018). https:\/\/www.kinephanos.ca\/2018\/the-speedrunning-museum-of-accidents\/. Accessed 6 Feb 2022"},{"issue":"4","key":"30_CR35","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"BS Stewart","year":"1991","unstructured":"Stewart, B.S., White, C.C.: Multiobjective A*. J. ACM 38(4), 775\u2013814 (1991). https:\/\/doi.org\/10.1145\/115234.115368","journal-title":"J. ACM"},{"key":"30_CR36","doi-asserted-by":"publisher","unstructured":"Szita, I.: Reinforcement learning in gamecurrs. In: Wiering, M., van Otterlo, M. (eds.) Reinforcement Learning: State-of-the-Art, pp. 539\u2013577. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-27645-3_17","DOI":"10.1007\/978-3-642-27645-3_17"},{"issue":"1","key":"30_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen, K.: Metaheuristics-the metaphor exposed. Int. Trans. Oper. Res. 22(1), 3\u201318 (2015). https:\/\/doi.org\/10.1111\/itor.12001","journal-title":"Int. Trans. Oper. Res."},{"key":"30_CR38","doi-asserted-by":"publisher","unstructured":"Togelius, J., Karakovskiy, S., Baumgarten, R.: The 2009 Mario AI competition. In: Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE Press (2010). https:\/\/doi.org\/10.1109\/CEC.2010.5586133","DOI":"10.1109\/CEC.2010.5586133"},{"key":"30_CR39","unstructured":"Volvy: Reddit post about the Morrowind all factions speedrun route (2018). www.reddit.com\/r\/speedrun\/comments\/9u1r9o\/using_ai_to_grind_out_routes\/e91dg6w\/. Accessed 6 Feb 2022"},{"key":"30_CR40","doi-asserted-by":"publisher","unstructured":"Ye, D., et al.: Mastering complex control in MOBA games with deep reinforcement learning. In: AAAI Conference on Artificial Intelligence 34(04), 6672\u20136679 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i04.6144","DOI":"10.1609\/aaai.v34i04.6144"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-02462-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:09:17Z","timestamp":1710248957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-02462-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031024610","9783031024627"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-02462-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.56","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}