Development of the A* Searching Algorithm Based Chinese Chess Game

• Main Authors: Ru-Cheng Yang, 楊儒誠
• Other Authors: Kuo-lan Su
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/31194993488792132830

碩士 === 國立雲林科技大學 === 電機工程系碩士班 === 99 === This thesis is to investigate the searching algorithm based path planning of the multi-robot system applying in the entertainment field. The small mobile robot is developed in our laboratory, to be as a chess piece. The Chinese chess game has 32 chesses, to be classified two players. We developed the user interface of the system, and programmed the communication protocol of this interface, and controlled mobile robots moving the corresponding position on real-time via wireless RF interface. Then the mobile robot programs the shortest motion path using A* searching algorithm, and plays the attribute of the chess piece. First we use experimental to improve that the shortest way to find the robot motion path by the mobile robot to achieve the proposed algorithm to be right, and use the mobile robot to implement the experimental scenario on the platform, and play the Chinese chess game.