{"id":"https://openalex.org/W7204671441","doi":"https://doi.org/10.1609/aiide.v22i1.43592","title":"Constraining the Expressive Range of Shortest Paths","display_name":"Constraining the Expressive Range of Shortest Paths","publication_year":2026,"publication_date":"2026-11-08","ids":{"openalex":"https://openalex.org/W7204671441","doi":"https://doi.org/10.1609/aiide.v22i1.43592"},"language":"en","primary_location":{"id":"doi:10.1609/aiide.v22i1.43592","doi":"https://doi.org/10.1609/aiide.v22i1.43592","is_oa":false,"landing_page_url":"https://doi.org/10.1609/aiide.v22i1.43592","pdf_url":null,"source":{"id":"https://openalex.org/S4387284112","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","issn_l":"2326-909X","issn":["2326-909X","2334-0924"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","raw_type":"journal-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5161298667","display_name":"Samuel Randall","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samuel Randall","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5095057067","display_name":"Mahsa Bazzaz","orcid":"https://orcid.org/0009-0004-0022-9611","observed_orcids":["https://orcid.org/0009-0004-0022-9611"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mahsa Bazzaz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126226682","display_name":"Seth Cooper","orcid":"https://orcid.org/0000-0003-4504-0877","observed_orcids":["https://orcid.org/0000-0003-4504-0877"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seth Cooper","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"1","first_page":"342","last_page":"349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":1.0,"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":1.0,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/procedural-level-generation","display_name":"procedural level generation","score":0.8119999766349792},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9620000123977661},{"id":"https://openalex.org/keywords/solution-path","display_name":"solution path","score":0.6159999966621399},{"id":"https://openalex.org/keywords/reachability-graph","display_name":"reachability graph","score":0.7089999914169312},{"id":"https://openalex.org/keywords/platform-games","display_name":"platform games","score":0.9179999828338623}],"concepts":[{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.47119998931884766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46970000863075256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3790999948978424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3774999976158142},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.290800005197525},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2766000032424927},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2508000135421753}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1609/aiide.v22i1.43592","doi":"https://doi.org/10.1609/aiide.v22i1.43592","is_oa":false,"landing_page_url":"https://doi.org/10.1609/aiide.v22i1.43592","pdf_url":null,"source":{"id":"https://openalex.org/S4387284112","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","issn_l":"2326-909X","issn":["2326-909X","2334-0924"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/43592","doi":null,"is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AIIDE/article/view/43592","pdf_url":null,"source":{"id":"https://openalex.org/S4306400155","display_name":"AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801652627","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/I2801652627"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2326-909X","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:share.osf.io:bc65d6b4-e1bc-49c6-a52c-7a439ecffc61","doi":null,"is_oa":false,"landing_page_url":"https://osf.io/zuej4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401127","display_name":"OSF Preprints (OSF Preprints)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799848540","host_organization_name":"Center for Open Science","host_organization_lineage":["https://openalex.org/I2799848540"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Project"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7110472586","https://openalex.org/W6990023303","https://openalex.org/W6995319666","https://openalex.org/W7112033203","https://openalex.org/W7169476771","https://openalex.org/W7113176801","https://openalex.org/W7004742420","https://openalex.org/W7116592803","https://openalex.org/W2777900195","https://openalex.org/W6962784611"],"abstract_inverted_index":{"Expressive":[0],"range":[1,45,131,217],"metrics":[2,13,90,137,218],"are":[3,255],"often":[4,22],"used":[5,87],"to":[6,50,57,88,102,164,177,213,229,243,258],"evaluate":[7],"procedural":[8],"level":[9,79,126,186],"generators.":[10],"Solution-path":[11],"related":[12],"require":[14],"using":[15],"an":[16,81],"agent":[17,56,107],"that":[18,112,120,179,193,237,254],"plays":[19],"the":[20,30,55,103,118,149,155,165,174,185,188,238],"level,":[21,150],"by":[23,261],"finding":[24],"a":[25,64,78,105,125,143,182,197,220],"single":[26],"shortest":[27,37,122],"path":[28,158,183,195],"through":[29,124,142,184],"level.":[31],"However,":[32],"there":[33,180],"may":[34,60,99,247],"be":[35,61,248,259],"multiple":[36],"paths":[38,123,141],"with":[39,114,157,187,196],"different":[40,198],"metrics.":[41,166],"Additionally,":[42],"in":[43,91,148,154,173,204,219],"expressive":[44,130,216],"analysis,":[46],"it":[47],"is":[48,68,181,201],"common":[49],"repeatedly":[51],"generate":[52,244],"levels":[53,230],"for":[54,76,251],"evaluate,":[58],"which":[59,73],"inefficient":[62],"when":[63],"desired":[65,129,189],"metric":[66,132,190,199,252],"value":[67,200],"known.":[69],"Recently,":[70],"constraint-based":[71],"approaches,":[72],"can":[74],"solve":[75],"both":[77],"and":[80,117,151,160,192,224,227],"example":[82,95],"solution":[83,96],"path,":[84,97],"have":[85,127],"been":[86],"constrain":[89],"generated":[92,231,260],"levels.":[93],"This":[94],"however,":[98],"not":[100,208],"correspond":[101],"one":[104],"shortest-path":[106],"would":[108],"take.":[109],"We":[110,134,167,210,235],"extend":[111],"work":[113],"path-state":[115,170,233,239],"reachability,":[116],"constraint":[119,175],"all":[121],"some":[128,205],"value.":[133],"view":[135],"agent-evaluated":[136],"as":[138],"properties":[139],"of":[140],"reachability":[144,171,240],"graph":[145,156,172],"on":[146],"locations":[147,153],"augment":[152],"length":[159],"state-based":[161],"information":[162],"relevant":[163],"use":[168],"this":[169,212],"problem":[176],"ensure":[178],"value,":[191],"any":[194],"longer":[202,242],"(or,":[203],"cases,":[206],"does":[207],"exist).":[209],"apply":[211],"various":[214],"path-based":[215],"top-down":[221],"exploration":[222],"game":[223],"platformer":[225],"game,":[226],"compare":[228],"without":[232],"reachability.":[234],"find":[236],"takes":[241],"levels,":[245],"but":[246],"more":[249],"efficient":[250],"values":[253],"less":[256],"likely":[257],"chance.":[262]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2026-08-30T00:00:00"}