研究生: |
王澤浩 Ze-Hao Wang |
---|---|
論文名稱: |
以遊玩特徵為導向的程序化內容生成方法 Game Design Goal Oriented Approach for Procedural Content Generation |
指導教授: |
戴文凱
Wen-Kai Tai |
口試委員: |
謝東儒
Tung-Ju Hsieh 鄭文皇 Wen-Huang Cheng 鮑興國 Hsing-Kuo Pao 戴文凱 Wen-Kai Tai |
學位類別: |
碩士 Master |
系所名稱: |
電資學院 - 資訊工程系 Department of Computer Science and Information Engineering |
論文出版年: | 2017 |
畢業學年度: | 105 |
語文別: | 中文 |
論文頁數: | 83 |
中文關鍵詞: | 程序化內容生成 、遊玩特徵 、遊戲關卡生成 、基因演算法 |
外文關鍵詞: | Procedural Content Generation, Gameplay Patterns, Game Level Generation, Genetic Algorithm |
相關次數: | 點閱:313 下載:11 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在本研究中,我們針對遊戲過程中的遊玩特徵 (gameplay patterns) 進行抽象化,使用程序化生成技術產生帶有意義遊戲關卡內容,藉此消彌或降低因隨機性所產生的不穩定要素,以改善並豐富遊戲體驗,最終提供一完整的遊戲關卡生成解決方案。
我們將「Mission/Space 框架」與「Multi-segment 演化」兩種關卡生成方法結合並修改予以適之,保留了前者追求的遊戲進程之順序性,後者帶來穩定且多樣化的遊戲內容,希冀藉此提升整體遊戲體驗、相輔相成。透過將遊戲關卡的劃分為任務 (Missions) 與空間 (Spaces) 兩種結構後,空間會依照任務結構進行有意義的同構轉換,並依照遊玩特徵定義基因演算法 (Genetic Algorithms) 的適應性函數,空間將透過基因演算法演化得出最適的遊戲物件佈局。
利用此關卡生成解決方案來設計關卡能有效減少開發時間、容易掌握遊戲各元件的配置外,同時讓玩家在進行遊戲時能夠遵循關卡設計師的劇情脈絡,亦能夠體驗到有意義且多樣化的遊戲關卡內容。
In this research, we focus on abstracting the "Gameplay Patterns" in the games. Using the "Procedural Content Generation" to generate the meaningful game levels. Improve the players' experience when they are in gameplay, then provide the a total solution for generating completed game levels.
We merge and modify two approaches that are "Mission/Space framework" and "Multi-segment Evolution". The first one keeps the sequence of game progressing, and the second one gives the stable and various content of game. Wish that can enhance the players' overall experience. Game levels are divided to two structures that are Missions and Spaces. Missions convert into a meaningful space isomorphically and follow the gameplay patterns to define the fitness functions of Genetic Algorithms. The spaces are based on the GA to evolve the fittest layout of game objects.
Reduce the costs of design the level effectively and manage all elements in games via using this solution of level generation. In the same time, keep the players can follow the stories that designed by game designers and enjoy in the meaningful and various content of game.
[1] J. Dormans, “Adventures in level design: generating missions and spaces for action
adventure games,” in Proceedings of the 2010 workshop on procedural content
generation in games, p. 1, ACM, 2010.
[2] J. Dormans, “Level design as model transformation: a strategy for automated content
generation,” in Proceedings of the 2nd International Workshop on Procedural
Content Generation in Games, p. 2, ACM, 2011.
[3] J. Dormans et al., Engineering emergence: applied theory for game design. Creative
Commons, 2012.
[4] A. Liapis, G. N. Yannakakis, and J. Togelius, “Generating map sketches for strategy
games,” in European Conference on the Applications of Evolutionary Computation,
pp. 264–273, Springer, 2013.
[5] A. Liapis, “Multi-segment evolution of dungeon game levels,” in Proceedings of the
Genetic and Evolutionary Computation Conference, 2017.
[6] J. H. Holland, Adaptation in natural and artificial systems: an introductory analysis
with applications to biology, control, and artificial intelligence. MIT press, 1992.
[7] D. Karavolos, A. Liapis, and G. N. Yannakakis, “Evolving missions to create game
spaces,” in Computational Intelligence and Games (CIG), 2016 IEEE Conference
on, pp. 1–8, IEEE, 2016.
[8] J. M. Font, R. Izquierdo, D. Manrique, and J. Togelius, “Constrained level generation
through grammar-based evolutionary algorithms,” in European Conference on the
Applications of Evolutionary Computation, pp. 558–573, Springer, 2016.
[9] “The binding of isaac: Rebirth wiki - rooms.” http://bindingofisaacrebirth.
gamepedia.com/Rooms. Accessed: 2017-07-23.
[10] A. Lipowski and D. Lipowska, “Roulette-wheel selection via stochastic acceptance,”
Physica A: Statistical Mechanics and its Applications, vol. 391, no. 6, pp. 2193–
2196, 2012.
[11] A. Baldwin and J. Holmberg, “Mixed-initiative procedural generation of dungeons
using game design patterns,” in Master thesis of Malmö University, Sweden, 2017.
[12] P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination
of minimum cost paths,” IEEE transactions on Systems Science and Cybernetics,
vol. 4, no. 2, pp. 100–107, 1968.
[13] A. Konak, D. W. Coit, and A. E. Smith, “Multi-objective optimization using genetic
algorithms: A tutorial,” Reliability Engineering & System Safety, vol. 91, no. 9,
pp. 992–1007, 2006.