Skip to main content

Advertisement

Springer Nature Link
Log in

The game map design based on A* algorithm

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

A* algorithm is widely used in the game for diameter, is currently one of the more popular heuristic search algorithm, but the algorithm has the problem of searching time and path. In this paper, a bidirectional search A* algorithm is proposed to improve the search efficiency and ensure the accuracy of the search, and effectively solve the problem of path twists and turns. Then, the algorithm is implemented by experiment simulation, which improves the effectiveness and feasibility of the algorithm in the large map.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Cheah KY (2015) Improving tower defense game AI (Differential evolution vs evolutionary programming)[J]

  2. Choi H, Choi E, Song S (2014) The structure of affection descriptors for social network game: case study of CityVille on facebook. Multimedia Tools Appl 68(2):375–389

    Article  Google Scholar 

  3. Dinges P, Agha G (2014) Solving complex path conditions through heuristic search on induced polytopes[C]//The, ACM Sigsoft Int Symp 425–436

  4. Du X, Cheng L, Cheng G (2014) A heuristic search algorithm for the multiple measurement vectors problem[J]. Signal Process 100(7):1–8

    Article  Google Scholar 

  5. Fridenfalk M (2014) The design and implementation of a generic A∗ algorithm for search in multidimensional space[C]//Games Media Entertainment. IEEE 282–283

  6. Gang X (2006) The general framework of chess-type flash game [J]. J MingJiang Univ 27(2)

  7. Guan QZ, Bao H, Shi ZJ (2016) The achievement of path planning based on A* Algorithm[J]. J Beijing Union Univ

  8. Guruji AK, Agarwal H, Parsediya DK (2016) Time-efficient A* algorithm for robot path planning [J]. Procedia Technol 23:144–149

    Article  Google Scholar 

  9. Hansen E A, Abdoulahi I (2015) Efficient bounds in heuristic search algorithms for stochastic shortest path problems[C]//Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI Press

  10. Hernández-Sabaté A, Joanpere M, Gorgorió N, et al. (2015) Mathematics learning opportunities when playing a Tower Defense Game[J]. Int J Serious Game

  11. Li Y, Zhou Z, Zhao W (2014) Performance analysis of pathfinding algorithms based on Map distribution[J]. Telkomnika Indones J Electr Eng 12(7):5537–5545

    Google Scholar 

  12. Persson SM, Sharf I (2014) Sampling-based A* algorithm for robot path-planning[J]. Int J Robot Res 33(13):1683–1708

    Article  Google Scholar 

  13. Ping LI, Zhu JY, Peng F, et al. (2014) Path planning based on visibility graph and A* algorithm[J]. Comput Eng

  14. Qiu S-M, Guo X-K (2013) Design and Implementation of the Flash Picking Fruits Game Based on ActionScript3.0. Modern Comput 6

  15. Rui K, Hong JM (2014) Application and optimized design of the automatic pathfinding A* algorithm[J]. J Shanghai Inst Technol 631:160–165

    Google Scholar 

  16. Sanchez K, Garces K, Casallas R (2015) A DSL for rapid prototyping of cross-platform tower defense games[C]//Computing Colombian Conference. IEEE

  17. Tan TG, Yong YN, Chin KO et al (2013) Automated evaluation for AI controllers in tower defense game using genetic algorithm[J]. Commun Comput Inf Sci 378:135–146

    Google Scholar 

  18. Zarraonandia T, Diaz P, Aedo I, Ruiz MR (2015) Designing educational games through a conceptual model based on rules and scenarios. Multimedia Tools Appl 74(13):4535–4559

    Article  Google Scholar 

  19. Zhang T (2015) The shortest path optimization method based on the A* algorithm research[J]. Bull Sci Technol

  20. Zhang P, Jiang A (2014) The development of tower defense game based on android system. Inf Comput (Conception Version) 03

  21. Zhao ZG, Liu RT (2015) A optimization of A* algorithm to make it close to human pathfinding behavior[C]//International Conference on Electrical, Computer Engineering and Electronics

Download references

Author information

Authors and Affiliations

  1. Information Technology College, Shanghai Jianqiao University, Shanghai, China

    Wang Minhui & Gao Xia

Authors
  1. Wang Minhui
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Gao Xia
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Gao Xia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Minhui, W., Xia, G. The game map design based on A* algorithm. Multimed Tools Appl 76, 17231–17253 (2017). https://doi.org/10.1007/s11042-016-3982-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-3982-1

Keywords