Risk is a game in which traditional Artificial-Intelligence methods such as for example iterative deepening and Alpha-Beta pruning can not successfully be applied due to the size of the search space. Distributed problem solving in the form of a multi-agent system might be the solution. This needs to be tested before it is possible to tell if a multi-agent system will be successful at playing Risk or not. In this thesis the development of a multi-agent system that plays Risk is explained. The system places an agent in every country on the board and uses a central agent for organizing communication. An auction mechanism is used for negotiation. The experiments show that a multi-agent solution indeed is a prosperous approach when developing a computer based player for the board game Risk.
[1]
Andrew S. Tanenbaum,et al.
Computer Networks, 3rd Edition
,
1996,
Prentice-Hall international editions.
[2]
Qiang Yang,et al.
Architectural Design Patterns for
,
1999
.
[3]
Richard M. Karp,et al.
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
,
1972,
Combinatorial Optimization.
[4]
Douglas H. Norrie,et al.
Patterns for Adaptive Multi-Agent Systems in Intelligent Manufacturing
,
1999
.
[5]
Barbara Messing,et al.
An Introduction to MultiAgent Systems
,
2002,
Künstliche Intell..
[6]
Henric Fransson.
AgentChess : An Agent Chess Approach
,
2003
.