Journal of Korea Game Society (한국게임학회 논문지)

Korea Game Society (한국게임학회)
권호 표지
DOI QR코드

DOI QR Code

Difficulty Evaluation of Game Levels using A Path-Finding Algorithm

경로 탐색 알고리즘을 이용한 게임 레벨 난이도 평가

  • Received : 2015.07.10
  • Accepted : 2015.08.05
  • Published : 2015.08.20
Download PDF
⟨ Previous Next ⟩

Abstract

The difficulty of the game is closely related to the fun of the game. However, it is not easy to determine the appropriate level of difficulty of the game. In most cases, human playtesting is required. But even so, it is still hard to quantitatively evaluate difficulty of the game. Thus, if we perform quantitative evaluation of the difficulty automatically it will be very helpful in game developments. In this paper, we use a path finding algorithm to evaluate difficulty of exploration in a game level. Exploration is a basic attribute in common video games and it represents the overall difficulty of the game level. We also optimize the proposed evaluation algorithm by using previous exploration histories when available area in an game level is dynamically expanded and the new search is required.

게임의 난이도는 게임의 재미와 깊은 연관이 있다. 하지만 게임 레벨의 난이도를 적절하게 결정하는 것은 쉽지 않다. 대부분의 경우 사람의 실제 게임 플레이를 통한 테스트가 요구한다. 또한 정량적인 평가도 어렵다. 따라서 게임 레벨 난이도의 정량적 평가를 자동으로 수행하는 것은 게임 개발에 많은 도움이 될 것이다. 이 논문에서는 경로 탐색 알고리즘을 사용하여 게임 레벨의 길 찾기 난이도를 평가하였다. 길을 찾는 것은 많은 게임들의 기본 속성으로 게임 레벨의 전반적인 난이도를 대표한다. 그리고 우리는 게임 레벨의 탐색 가능 영역이 동적으로 확장되고 다시금 탐색이 요구되는 경우 이전 경로 탐색 결과를 재사용하여 난이도 평가 알고리즘의 성능을 최적화하였다.

Keywords

References

  1. Sorenson, N. and Pasquier, P., "Towards a generic framework for automated video game level creation", In Applications of Evolutionary Computation, pp. 131-140, 2010.
  2. Sorenson, N. and Pasquier, P., "The evolution of fun: Automatic level design through challenge modeling", In Proceedings of the First International Conference on Computational Creativity, pp. 258-267, 2010.
  3. Sorenson, N., Pasquier, P. and DiPaola, S., "A generic approach to challenge modeling for the procedural creation of video game levels", IEEE Transactions on Computational Intelligence and AI in Games, v.3, no.3, pp. 229-244. 2011. https://doi.org/10.1109/TCIAIG.2011.2161310
  4. Browne, C. and Maire, F., "Evolutionary game design", IEEE Transactions on Computational Intelligence and AI in Games, v.2, no.1, pp. 1-16. 2010. https://doi.org/10.1109/TCIAIG.2010.2044611
  5. Liapis, A., Yannakakis, G. N. and Togelius, J., "Towards a Generic Method of Evaluating Game Levels", In AIIDE, 2013.
  6. Miyamoto, S., Yamauchi, H. and Tezuka, T., "Super Mario Bros", Nintendo, 1987.
  7. Dechter, R. and Pearl, J., "Generalized best-first search strategies and the optimality of A*", Journal of the ACM (JACM), v.32, no.3, pp. 505-536, 1985. https://doi.org/10.1145/3828.3830
  8. Koenig, S. and Likhachev, M., "Improved fast replanning for robot navigation in unknown terrain", In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA'02), v. 1, pp. 968-975, 2002.
  9. Koenig, S. and Likhachev, M., "Incremental A*", In NIPS, pp. 1539-1546, 2001.
  10. Likhachev, M., Ferguson, D. I., Gordon, G. J., Stentz, A. and Thrun, S., "Anytime Dynamic A*: An Anytime, Replanning Algorithm", In ICAPS, pp. 262-271, 2005.
  11. Likhachev, M., Gordon, G. J. and Thrun, S., "ARA*: Anytime A* with provable bounds on sub-optimality", In Advances in Neural Information Processing Systems, 2003.
  12. Bjornsson, Y. and Halldorsson, K., "Improved Heuristics for Optimal Path-finding on Game Maps", In AIIDE, pp. 9-14, 2006.
  13. Oh-Ik Kwon and Teag-Keun Whangbo, "A Dynamic Path-Finding Method Avoiding Moving Obstacles in 3D Game Environment", Journal of Korea Game Society, v.6, no.3, pp.3-12, 2006.
  14. John Olsen, "Attraction and Repulsors", Microsoft, Game Programming Gems, Charles River Media, 2004.
  15. Sung Hyun Cho, "A Pathfinding Algorithm Using Path Information", Journal of Korea Game Society, v.13, no.1, pp.31-40, 2013. https://doi.org/10.7583/JKGS.2013.13.1.31
  16. Togelius, J., Karakovskiy, S. and Baumgarten, R., "The 2009 mario ai competition", In Evolutionary Computation (CEC), pp. 1-8, 2010.