The Complexity Analysis for Game Map Based on the Summation of XOR

Yan Li; Zhen Hua Zhou; Wen Ju Zhao; He Ling Zhao

doi:10.4028/www.scientific.net/AMM.411-414.1990

Paper Titles

Constructing Immunoglobulin-Based Artificial Immune Algorithm for Parallel-Machine Scheduling
p.1971

Rule Acquisition Based on Inconsistent Decision-Making Information System
p.1975

The Realization of Genetic Algorithm in Terms of Checkers Evaluation Function
p.1979

Training Neural Networks by Continued Fractional Weight Functions
p.1986

The Complexity Analysis for Game Map Based on the Summation of XOR
p.1990

A Map Complexity Measure Based on Contact Surface
p.1994

Research on Neural Networks Used in Parallel Computing
p.1998

An AHP-Based Fuzzy Approach for Evaluation of Index System on Coordinated Development of Ethnic Regions in China
p.2002

A Negative Selection Algorithm Base on the Self R-Tree
p.2007

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 411-414The Complexity Analysis for Game Map Based on the...

The Complexity Analysis for Game Map Based on the Summation of XOR

Abstract:

The complexity of map scenes of computer games has important influence to the degree of games difficulty, and it is also the key factor of pathfinding performance. In this paper, a kind of maps complexity metric index which based on the accumulation of xor is defined. The index calculates map complexity through accumulating the xor-value of each adjacent cells line by line. The experimental results demonstrates that the metric index is highly relative with the efficiency of A* and HPA* algorithm. It can provide reference for the design of game maps.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 411-414)

Pages:

1990-1993

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.411-414.1990

Citation:

Cite this paper

Online since:

September 2013

Authors:

Yan Li, Zhen Hua Zhou, Wen Ju Zhao, He Ling Zhao

Keywords:

Accumulation of Xor, Complexity Measuring, Game Map, Hamming Distance, Relativity

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] S. Rabin, in: AI Game Programming Wisdom, edited by Tsinghua University Press, Beijing, China (2005).

Google Scholar

[2] A. Botea, M. Muller and J. Schaeffer: Journal of Game Development. Vol. 1(1)(2004), pp.7-28.

Google Scholar

[3] Yibiao Lu, Xiaoming Huo and P. Tsiotras: Beamlet-like data processing for accelerated path-planning using multiscale information of the environment. In: Proceeding of 49th IEEE Conference on Decision Control. Atlanta, GA, pp.3808-3813, (2010).

DOI: 10.1109/cdc.2010.5717586

Google Scholar

[4] A. Mowshowitz: An Index of the Relative Complexity of a Graph Bulletin of Mathematical Biophysics. Vol. 30(1)(1968), pp.175-204.

DOI: 10.1007/bf02476948

Google Scholar

[5] A. MacEachren: The American Cartographer. Vol. 9(1982), pp.31-46.

Google Scholar

[6] F. David: Cartographic Journal. Vol. 43(3)(2006), pp.224-238.

Google Scholar

[7] Pan Su, Yan Li and Wenliang Li: A Game Map Complexity Measure Based on Hamming Distance. In: Proc. of the 3rd International Conference on Computational Intelligence and Industrial Application. Wuhan, China, pp.332-335, 2010. (In Chinese).

Google Scholar

[8] Yan Li, Tiesong Li and Cai Chen: Computer Engineering. Vol. 38(2012), pp.10-12. (In Chinese).

Google Scholar