Feasible–Infeasible Two-Population Genetic Algorithm to evolve dungeon levels with dependencies in barrier mechanics

Author:

Viana Breno M.F.ORCID,Pereira Leonardo T.,Toledo Claudio F.M.ORCID,dos Santos Selan R.ORCID,Maia Silvia M.D.M.ORCID

Funder

Fundação de Amparo à Pesquisa do Estado de São Paulo

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Publisher

Elsevier BV

Subject

Software

Reference34 articles.

1. Rogue;Toy,1980

2. The binding of isaac;McMillen,2011

3. Moonlighter;Sun,2018

4. Dead cells;Twin,2018

5. Procedural generation of dungeons;van der Linden;IEEE Trans. Comput. Intell. AI Games,2014

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A mixed-initiative design framework for procedural content generation using reinforcement learning;Entertainment Computing;2025-01

2. 2-Step Evolutionary Algorithm for the generation of dungeons with lock door missions using horizontal symmetry;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

3. A Context-Aware Approach Framework to Algorithm Selection for Search Based Procedural Content Generation;2024 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT);2024-07-04

4. Literally Unplayable: On Constraint-Based Generation of Uncompletable Levels;Proceedings of the 19th International Conference on the Foundations of Digital Games;2024-05-21

5. Sturgeon-MKIII: Simultaneous Level and Example Playthrough Generation via Constraint Satisfaction with Tile Rewrite Rules;Proceedings of the 18th International Conference on the Foundations of Digital Games;2023-04-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3