Based on Short Motion Paths and Artificial Intelligence Method for Chinese Chess Game

Authors
Chien-Ming Hung, Jr-Hung Guo, Kuo-Lan Su
Corresponding Author
Kuo-Lan Su
Available Online 1 September 2017.
DOI
https://doi.org/10.2991/jrnal.2017.4.2.11How to use a DOI?
Keywords
Evaluation algorithm, artificial intelligence method, wireless RF interface, enhance A* searching algorithm
Abstract
The article develops the decision rules to win each set of the Chinese chess game using evaluation algorithm and artificial intelligence method, and uses the mobile robot to be instead of the chess, and presents the movement scenarios using the shortest motion paths for mobile robots. Player can play the Chinese chess game according to the game rules with the supervised computer. The supervised computer decides the optimal motion path to win the set using artificial intelligence method, and controls mobile robots according to the programmed motion paths of the assigned chesses moving on the platform via wireless RF interface. We uses enhance A* searching algorithm to solve the shortest path problem of the assigned chess, and solve the collision problems of the motion paths for two mobile robots moving on the platform simultaneously. We implement a famous set to be called “wild horses run in farm” using the proposed method. First we use simulation method to display the motion paths of the assigned chesses for the player and the supervised computer. Then the supervised computer implements the simulation results on the chessboard platform using mobile robots. Mobile robots move on the chessboard platform according to the programmed motion paths and is guided to move on the centre line of the corridor, and avoid the obstacles (chesses), and detect the cross point of the platform using three reflective IR modules.

Copyright
© 2013, the Authors. Published by ALife Robotics Corp. Ltd.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).