{"id":"https://openalex.org/W3088531255","doi":"https://doi.org/10.1145/3402942.3409603","title":"Spatial Layout of Procedural Dungeons Using Linear Constraints and SMT Solvers","display_name":"Spatial Layout of Procedural Dungeons Using Linear Constraints and SMT Solvers","publication_year":2020,"publication_date":"2020-09-15","ids":{"openalex":"https://openalex.org/W3088531255","doi":"https://doi.org/10.1145/3402942.3409603","mag":"3088531255"},"language":"en","primary_location":{"id":"doi:10.1145/3402942.3409603","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3402942.3409603","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3402942.3409603","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on the Foundations of Digital Games","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3402942.3409603","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037589547","display_name":"Jim Whitehead","orcid":"https://orcid.org/0000-0002-6887-7330"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jim Whitehead","raw_affiliation_strings":["University of California Santa Cruz, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Santa Cruz, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037589547"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":1.6731,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.94820972,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9907000064849854,"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/T11439","display_name":"Video Analysis and Summarization","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/solver","display_name":"Solver","score":0.8161300420761108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7912906408309937},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7373851537704468},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7285072803497314},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6450650691986084},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5180790424346924},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4540350139141083},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4358375072479248},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.41141659021377563},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4113355278968811},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3704940676689148},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3689917325973511},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.28421714901924133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1645493507385254},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13070720434188843}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8161300420761108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7912906408309937},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7373851537704468},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7285072803497314},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6450650691986084},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5180790424346924},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4540350139141083},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4358375072479248},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.41141659021377563},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4113355278968811},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3704940676689148},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3689917325973511},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.28421714901924133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1645493507385254},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13070720434188843}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3402942.3409603","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3402942.3409603","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3402942.3409603","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on the Foundations of Digital Games","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3402942.3409603","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3402942.3409603","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3402942.3409603","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on the Foundations of Digital Games","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3088531255.pdf","grobid_xml":"https://content.openalex.org/works/W3088531255.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1801799","https://openalex.org/W36304730","https://openalex.org/W184452495","https://openalex.org/W369039322","https://openalex.org/W1480909796","https://openalex.org/W1559408176","https://openalex.org/W1580024793","https://openalex.org/W1580940432","https://openalex.org/W1947219827","https://openalex.org/W1984443112","https://openalex.org/W1995201048","https://openalex.org/W2025336173","https://openalex.org/W2060020482","https://openalex.org/W2069547117","https://openalex.org/W2087216833","https://openalex.org/W2108806781","https://openalex.org/W2128888606","https://openalex.org/W2152660354","https://openalex.org/W2395774634","https://openalex.org/W2532752874","https://openalex.org/W2574952924","https://openalex.org/W2612646361","https://openalex.org/W2621283775","https://openalex.org/W2700693968","https://openalex.org/W2891010802","https://openalex.org/W2960202457","https://openalex.org/W2971616453","https://openalex.org/W2971863226","https://openalex.org/W3099345087","https://openalex.org/W3216498147","https://openalex.org/W4300926135"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W2087572620","https://openalex.org/W1505872263","https://openalex.org/W4243317326","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W2810367355"],"abstract_inverted_index":{"Dungeon":[0],"generation":[1,22],"is":[2,119],"among":[3],"the":[4,12,59,123,127,132,149],"oldest":[5],"problems":[6],"in":[7],"procedural":[8],"content":[9],"generation.":[10],"Creating":[11],"spatial":[13],"aspects":[14],"of":[15,23,28,45,91,100,111,126,134],"a":[16,32,43,51,72,88,135],"dungeon":[17,65,82,139],"requires":[18],"three":[19],"steps:":[20],"random":[21],"rooms":[24,30,37,66,83,101],"and":[25,35,70,81,102,148],"sizes,":[26],"placement":[27,60],"these":[29,92],"inside":[31],"fixed":[33,74,89],"area,":[34],"connecting":[36],"with":[38,98],"passageways.":[39],"This":[40],"paper":[41],"uses":[42],"series":[44],"integer":[46],"linear":[47],"constraints,":[48,103],"solved":[49],"by":[50],"satisfiability":[52],"modulo":[53],"theories":[54],"(SMT)":[55],"solver,":[56],"to":[57,114,138],"perform":[58],"step.":[61],"Separation":[62],"constraints":[63],"ensure":[64],"do":[67],"not":[68],"intersect":[69],"maintain":[71],"minimum":[73],"separation.":[75],"Designers":[76],"can":[77,144],"specify":[78],"control":[79,93],"lines,":[80],"will":[84],"be":[85],"placed":[86],"within":[87],"distance":[90],"lines.":[94],"Generation":[95],"times":[96],"vary":[97],"number":[99],"but":[104,118],"are":[105],"often":[106],"very":[107],"fast.":[108],"Spatial":[109],"distribution":[110],"solutions":[112],"tend":[113],"have":[115],"hot":[116],"spots,":[117],"surprisingly":[120],"uniform":[121],"given":[122],"underlying":[124],"complexity":[125],"solver.":[128],"The":[129],"approach":[130,137],"demonstrates":[131],"effectiveness":[133],"declarative":[136],"layout":[140],"generation,":[141],"where":[142],"designers":[143],"express":[145],"desired":[146],"intent,":[147],"SMT":[150],"solver":[151],"satisfies":[152],"this":[153],"if":[154],"possible.":[155]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2025-10-10T00:00:00"}