A Game Map Complexity Measure Based on Hamming Distance
暂无分享,去创建一个
Yan Li | Pan Su | Wen-Liang Li
[1] Abbe Mowshowitz,et al. Entropy and the complexity of graphs , 1967 .
[2] Alexander Nareyek,et al. Game AI is Dead. Long Live Game AI! , 2007, IEEE Intelligent Systems.
[3] Alan M. MacEachren,et al. Map Complexity: Comparison and Measurement , 1982 .
[4] Patrick Doherty,et al. Probabilistic roadmap based path planning for an autonomous unmanned helicopter , 2006, J. Intell. Fuzzy Syst..
[5] Adi Botea,et al. Near Optimal Hierarchical Path-Finding , 2004, J. Game Dev..
[6] P. Jaccard,et al. Etude comparative de la distribution florale dans une portion des Alpes et des Jura , 1901 .
[7] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[8] A. Mowshowitz,et al. Entropy and the complexity of graphs. I. An index of the relative complexity of a graph. , 1968, The Bulletin of mathematical biophysics.
[9] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[10] Alexander Nareyek,et al. AI in Computer Games , 2004, ACM Queue.
[11] David Fairbairn,et al. Measuring Map Complexity , 2006 .