矮人地下城的进化任务

2016 IEEE Conference on Computational Intelligence and Games (CIG) Pub Date : 2016-09-01 DOI:10.1109/CIG.2016.7860391

Daniel Karavolos, Antonios Liapis, Georgios N. Yannakakis

{"title":"矮人地下城的进化任务","authors":"Daniel Karavolos, Antonios Liapis, Georgios N. Yannakakis","doi":"10.1109/CIG.2016.7860391","DOIUrl":null,"url":null,"abstract":"This paper describes a search-based level generation approach that uses the search space of action sequences, represented as graphs, rather than spatial layouts. The search is guided by mutation operators that manipulate the graph topology, and the paper explores various objective functions that are based on generic level evaluation metrics. The evolved action sequences are passed to a grammar-based system and a layout solver transforms them into dungeon levels for the Dwarf Quest game.","PeriodicalId":6594,"journal":{"name":"2016 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"68 1","pages":"1-2"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Evolving missions for Dwarf quest dungeons\",\"authors\":\"Daniel Karavolos, Antonios Liapis, Georgios N. Yannakakis\",\"doi\":\"10.1109/CIG.2016.7860391\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a search-based level generation approach that uses the search space of action sequences, represented as graphs, rather than spatial layouts. The search is guided by mutation operators that manipulate the graph topology, and the paper explores various objective functions that are based on generic level evaluation metrics. The evolved action sequences are passed to a grammar-based system and a layout solver transforms them into dungeon levels for the Dwarf Quest game.\",\"PeriodicalId\":6594,\"journal\":{\"name\":\"2016 IEEE Conference on Computational Intelligence and Games (CIG)\",\"volume\":\"68 1\",\"pages\":\"1-2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Conference on Computational Intelligence and Games (CIG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2016.7860391\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Conference on Computational Intelligence and Games (CIG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2016.7860391","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文描述了一种基于搜索的关卡生成方法，该方法使用动作序列的搜索空间(以图表表示)，而不是空间布局。搜索由操纵图拓扑的突变算子引导，论文探索了基于通用水平评估指标的各种目标函数。进化后的动作序列被传递给基于语法的系统，布局解决器将其转化为《Dwarf Quest》的地下城关卡。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Evolving missions for Dwarf quest dungeons

This paper describes a search-based level generation approach that uses the search space of action sequences, represented as graphs, rather than spatial layouts. The search is guided by mutation operators that manipulate the graph topology, and the paper explores various objective functions that are based on generic level evaluation metrics. The evolved action sequences are passed to a grammar-based system and a layout solver transforms them into dungeon levels for the Dwarf Quest game.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 IEEE Conference on Computational Intelligence and Games (CIG)

自引率

0.00%

发文量