By Topic

A genetic search method for multi-player game playing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tzung-Pei Hong ; Dept. of Inf. Manage., I-Shou Univ., Kaohsiung, Taiwan ; Ke-Yuan Huang ; Wen-Yang Lin

It is well known that when exploring a game tree, the deeper the depth, the more accurate the move prediction but greater temporal and spatial expansion is required. How to explore the game tree deeper is a great challenge in such research. In T.P. Hong et al (Int. Conf. on Evolutionary Computation, Anchorage, Alaska, USA, p.690-4, 1998), we proposed a genetic algorithm-based search method for two-player games. In this paper, we generalize that method to solve multi-player game-search problems. We propose a genetic algorithm-based approach that can find good next moves in multi-player games without the requirement for great temporal and spatial expansion

Published in:

Systems, Man, and Cybernetics, 2000 IEEE International Conference on  (Volume:5 )

Date of Conference: