{"id":"https://openalex.org/W2808831986","doi":"https://doi.org/10.4230/lipics.fun.2018.30","title":"The Complexity of Escaping Labyrinths and Enchanted Forests","display_name":"The Complexity of Escaping Labyrinths and Enchanted Forests","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2808831986","doi":"https://doi.org/10.4230/lipics.fun.2018.30","mag":"2808831986"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8821","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol100-fun2018/LIPIcs.FUN.2018.30/LIPIcs.FUN.2018.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol100-fun2018/LIPIcs.FUN.2018.30/LIPIcs.FUN.2018.30.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084156862","display_name":"Florian D. Schwahn","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Schwahn, Florian D.","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany","University of Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050306276","display_name":"Clemens Thielen","orcid":"https://orcid.org/0000-0003-0897-3571"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thielen, Clemens","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany","University of Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0897-3571","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06467353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"100","issue":null,"first_page":"13","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11197","display_name":"Digital Games and Media","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11674","display_name":"Sports Analytics and Performance","score":0.9466999769210815,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/face","display_name":"Face (sociological concept)","score":0.6706438660621643},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6400579810142517},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.6356379985809326},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5595725774765015},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5336312651634216},{"id":"https://openalex.org/keywords/dice","display_name":"Dice","score":0.5294100046157837},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5151854753494263},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5111749768257141},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.49746444821357727},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4426409602165222},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.44016656279563904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41501879692077637},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3735108971595764},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3687763810157776},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35826799273490906},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3255787491798401},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.27128976583480835},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.2709513306617737},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.17943546175956726},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.13390758633613586},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11636874079704285},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.10158756375312805}],"concepts":[{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.6706438660621643},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6400579810142517},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.6356379985809326},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5595725774765015},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5336312651634216},{"id":"https://openalex.org/C22029948","wikidata":"https://www.wikidata.org/wiki/Q45089","display_name":"Dice","level":2,"score":0.5294100046157837},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5151854753494263},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5111749768257141},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.49746444821357727},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4426409602165222},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.44016656279563904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41501879692077637},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3735108971595764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3687763810157776},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35826799273490906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3255787491798401},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.27128976583480835},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.2709513306617737},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.17943546175956726},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.13390758633613586},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11636874079704285},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.10158756375312805},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:8821","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol100-fun2018/LIPIcs.FUN.2018.30/LIPIcs.FUN.2018.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1524085","is_oa":false,"landing_page_url":"https://mediatum.ub.tum.de/1524085","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.fun.2018.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fun.2018.30","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2808831986","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/fun/fun2018.html#SchwahnT18","pdf_url":null,"source":{"id":"https://openalex.org/S4306418466","display_name":"Fun with Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Fun with Algorithms","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8821","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol100-fun2018/LIPIcs.FUN.2018.30/LIPIcs.FUN.2018.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2808831986.pdf","grobid_xml":"https://content.openalex.org/works/W2808831986.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2894889276","https://openalex.org/W2396404338","https://openalex.org/W2184536951","https://openalex.org/W2124109849","https://openalex.org/W3008804360","https://openalex.org/W2185922188","https://openalex.org/W87592707","https://openalex.org/W2083897187","https://openalex.org/W3135200870","https://openalex.org/W1492784903","https://openalex.org/W2963920675","https://openalex.org/W3122778424","https://openalex.org/W2149732664","https://openalex.org/W2572416209","https://openalex.org/W2574366302","https://openalex.org/W2014192080","https://openalex.org/W2145471712","https://openalex.org/W3043589902","https://openalex.org/W2163548787","https://openalex.org/W2809383981"],"abstract_inverted_index":{"The":[0,3],"board":[1,211],"games":[2],"aMAZEing":[4],"Labyrinth":[5,8],"(or":[6],"simply":[7],"for":[9,61,201,212,223],"short)":[10],"and":[11,133],"Enchanted":[12,125],"Forest":[13],"published":[14],"by":[15,153],"Ravensburger":[16],"are":[17,128,151,192,238],"seemingly":[18],"simple":[19],"family":[20],"games.":[21],"In":[22,124],"Labyrinth,":[23],"the":[24,41,45,56,79,86,91,134,137,145,170,181,185,189,210,224,228,232],"players":[25,138,229],"move":[26],"though":[27],"a":[28,72,76,109,203,213],"labyrinth":[29,46,92],"in":[30,47,90,147,158,177,187,231],"order":[31,48,186],"to":[32,49,85,113,140,144,165],"collect":[33],"specific":[34,131],"items.":[35],"To":[36],"do":[37],"so,":[38],"they":[39],"shift":[40],"tiles":[42],"making":[43],"up":[44,51],"open":[50],"new":[52],"paths":[53,60],"(and,":[54],"at":[55],"same":[57],"time,":[58],"close":[59],"their":[62,142],"opponents).":[63],"We":[64],"show":[65,98],"that,":[66,99],"even":[67],"without":[68],"any":[69],"opponents,":[70],"determining":[71],"shortest":[73,204],"path":[74,77,205],"(i.e.,":[75],"using":[78],"minimum":[80],"possible":[81],"number":[82],"of":[83,136,161,169,216,226],"turns)":[84],"next":[87,116],"desired":[88],"item":[89,117],"is":[93,122,139],"strongly":[94],"NP-hard.":[95],"Moreover,":[96],"we":[97,195],"when":[100,234],"competing":[101],"with":[102],"another":[103],"player,":[104],"deciding":[105],"whether":[106],"there":[107],"exists":[108],"strategy":[110],"that":[111],"guarantees":[112],"reach":[114],"one's":[115,120],"faster":[118],"than":[119],"opponent":[121],"PSPACE-hard.":[123],"Forest,":[126],"items":[127],"hidden":[129],"under":[130],"trees":[132],"objective":[135],"report":[141],"locations":[143],"king":[146],"his":[148],"castle.":[149],"Movements":[150],"performed":[152],"rolling":[154],"two":[155,159,171,190,207],"dice,":[156],"resulting":[157],"numbers":[160],"fields":[162,208],"one":[163,178],"has":[164,221],"move,":[166],"where":[167],"each":[168],"movements":[172,191],"must":[173],"be":[174],"executed":[175],"consecutively":[176],"direction":[179],"(but":[180],"player":[182],"can":[183],"choose":[184],"which":[188,219],"performed).":[193],"Here,":[194],"provide":[196],"an":[197],"efficient":[198],"polynomial-time":[199],"algorithm":[200],"computing":[202],"between":[206],"on":[209],"given":[214],"sequence":[215],"die":[217,236],"rolls,":[218],"also":[220],"implications":[222],"complexity":[225],"problems":[227],"face":[230],"game":[233],"future":[235],"rolls":[237],"unknown.":[239]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}