Planning an endgame move set for the game RISK: A comparison of search algorithms

IEEE Transactions on Evolutionary Computation

Volumn 9, Issue 6, 2005, Pages 641-652

  Vaccaro, James M ^a,b   Guest, Clark C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Lockheed Martin Information Assurance   (United States)

Author keywords

Dynamic planning; Genetic algorithm; Search algorithms

Indexed keywords

EVOLUTIONARY ALGORITHMS; GRADIENT METHODS; PROBABILITY; RANDOM PROCESSES; SIMULATED ANNEALING;

DYNAMIC PLANNING; GRADIENT ASCENT; RANDOM WALK; SEARCH ALGORITHMS;

GAME THEORY;

EID: 29244469656     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2005.856211     Document Type: Article

References (17)

1. J. Vaccaro and C. Guest, "Evolutionary bayesian network dynamic planner for game RISK," in Lecture Notes in Computer Science, Proc. Appl. Evol. Comput., Coimbra, Portugal, Apr. 2004, pp. 549-560.
2. R. Levinson, F. H. Hsu, J. Schaeffe, T. A. Marsland, and D. E. Wilkins, "The role of chess in artificial-intelligence research," ICCA J., vol. 14, no. 3, pp. 153-161, 1991.
3. D. B. Fogel, Blondie24: Playing at the Edge of AI. San Mateo, CA: Morgan Kaufman, 2002.
4. G. Tesauro, "Temporal difference learning and TD-gammon," Commun. ACM, vol. 38, no. 3, pp. 58-68, 1995.
5. M. Muller, "Computer Go," Artif. Intell., vol. 134, no. 1-2, pp. 145-179.
6. M. L. Littman, "Value-function reinforcement learning in Markov games," J. Cogn. Syst. Res., vol. 2, pp. 55-66, 2001.
7. T. Taipale, S. Pieska, and J. Riekki, "Dynamic planning based control of autonomous machine," in Proc. Real-Time Syst., 1991, pp. 120-126.
8. H. J. van den Herik, J. W. H. M. Uiterwijk, and J. van Rijswijck, "Games solved: Now and in the future," Artif. Intell., vol. 134, pp. 277-311, 2002.
9. J. Vaccaro, C. Guest, and D. Ross, "Evolutionary programming for goal-driven dynamic planning, in Proc. SPIE's l6th Aerosense Symp., vol. 4739, Orlando, FL, Apr. 2002, pp. 28-39.
10. R. S. Sutton and A. Barto, Introduction to Reinforcement Learning. Cambridge, MA: MIT Press, 1998.
11. D. B. Fogel, "The advantages of evolutionary computation," in Bio-Computing and Emergent Computation, D. Lundh, B. Olsson, and A. Narayanan, Eds. Singapore: World Scientific, 1997, pp. 1-11.
12. A. F. R. Araujo and A. P. S. Braga, "Reward-penalty reinforcement learning scheme for planning and reactive behavior," in Proc. IEEE Int. Conf. Syst., Man, Cybern., vol. 2, 1998, pp. 1485-1490.
13. G. Tesauro, "Programming backgammon using self-teaching neural nets," Artif. Intell., vol. 134, pp. 181-199, 2002.
14. V. W. Porto, "Using evolutionary programming to optimize the allocation of surveillance assets," Lecture Notes in Computer Science, vol. 1585, pp. 215-222, 1999.
15. J. B. Zydallis, "Explicit building-block multi-objective genetic algorithms: Theory, analysis and development," Ph.D. dissertation, Air Force Inst. Technology, Wright-Patterson AFB, OH, Mar. 2003.
16. J. Osborne, Markov Chains for the RISK Board Game Revisited: Math. Mag., Apr. 2003, vol. 76, pp. 129-135.
17. N. Nilsson, Artificial Intelligence: A New Synthesis. San Mateo, CA: Morgan Kaufmann, 1998.