Skip to main content

Advertisement

Springer Nature Link
Log in

A* search algorithm applied to a Chinese chess game

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

This article presents an A* search algorithm to be applied to path planning in a Chinese chess game, and uses multiple mobile robots to present the scenario. The mobile robots have a cylindrical shape, and their diameter, height, and weight are 8 cm, 15 cm, and 1.5 kg, respectively. The controller of the mobile robots is a MCS-51 chip. We play the Chinese chess game using multiple mobile robots according to the evaluation algorithm of the game, and calculate the displacement by the encoder of a DC servomotor. The A* search algorithm can solve the shortest-path problem for the mobile robots from the starting point to the target point on the chess board. The simulated results found the shortest path for the mobile robots (chess pieces) moving to target points from their starting points in a collision-free environment. Finally, we implemented the experimental results on a Chinese chess board using mobile robots. Users can play the Chinese chess game using the supervising computer via a wireless RF interface. The scenario of the feedback of the Chinese chess game to the user interface uses an image system.

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Yen SJ, Chen JC, Yang TN, et al (2004) Computer Chinese chess. ICGA J 27(1):3–18

    Google Scholar 

  2. Darwen P, Yao X (2002) Co-evolution in the iterated prisoner’s dilemma with intermediate levels of cooperation: application to missile defense. Int J Comput Intell Appl 2(1):83–107

    Article  Google Scholar 

  3. Yong CH, Miikkulainen R (2001) Cooperative co-evolution of multi-agent systems. University of Texas, Austin, Tech. Rep. AI01-287

    Google Scholar 

  4. Ong CS, Quek HY, Tan KC, et al (2007) Discovering Chinese Chess strategies through co-evolutionary approaches. IEEE Symposium on Computational Intelligence and Games, pp 360–367

  5. Wang J, Luo YH, Qiu DN, et al (2005) Adaptive genetic algorithm’s implement on evaluation function in computer Chinese chess. Proceeding of ISCIT, pp 1206–1209

  6. Lee WP, Liu LJ, Chiou JA (2006) A component-based framework to rapidly prototype online chess game for home entertainment. IEEE International Conference on System, Man and Cybernetics, pp 4011–4016

  7. Zhou W, Zhang JL, Wang YZ (2008) The iterative sort search techniques based on percentage evaluation. Chinese Control and Decision Conference, pp 5263–5266

  8. Su KL, Shiau SV, Guo JH, et al (2009) Mobile robot based on-line Chinese chess game. 4th International Conference on Innovative Computing, Information and Control, p 63

  9. Saber Y, Senjyu T (2007) Memory-bounded ant colony optimization with dynamic programming and A* local search for generator planning. IEEE Trans Power Syst 22(4):1965–1973

    Article  Google Scholar 

  10. Chia SH, Su KL, Wang CC, et al (2010) Multiple robot system applying in Chinese chess game. Innovative Comput Inform Control, Express Lett (ICIC-EL) 4(5B):2027–2032

    Google Scholar 

  11. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC4 4(2):100–107. 10.1109/TSSC.1968.300136

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, National Yunlin University of Science and Technology, Yunlin, Taiwan

    Kuo-Lan Su

  2. Graduate School Engineering Science and Technology, National Yunlin University of Science and Technology, Yunlin, Taiwan

    Cheng-Yun Chung

  3. Department of Aeronautical Engineering, National Formosa University, Yunlin, Taiwan

    Jie-Tong Zou

  4. Industrial Technology Research Institute, Taipei, Taiwan

    Te-Yi Hsu

Authors
  1. Kuo-Lan Su
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Cheng-Yun Chung
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Jie-Tong Zou
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Te-Yi Hsu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Kuo-Lan Su.

Additional information

This work was presented in part at the 16th International Symposium on Artificial Life and Robotics, Oita, Japan, January 27–29, 2011

About this article

Cite this article

Su, KL., Chung, CY., Zou, JT. et al. A* search algorithm applied to a Chinese chess game. Artif Life Robotics 16, 132–136 (2011). https://doi.org/10.1007/s10015-011-0882-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-011-0882-3

Key words