Abstract
With regard to literature, improved estimations for the number of possible moves and placements are provided, showing that the complexity of Diplomacy is enormous, making it a good candidate for machine learning and evolutionary learning techniques. To enhance the playing strength of an existing Diplomacy bot and alleviate the distance to the presumed best current bot, a look-ahead planning component based on nested evolutionary algorithms, is then implanted into an already existing bot. The experimental investigation shows that the resulting bot is significantly improved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackermann, N.: Evolutionäre Spielbaumsuche für das Strategiespiel Diplomacy. Dipl. Inf. Diploma Thesis, TU Dortmund, Department of Computer Science (2010)
Booijink, B.: Strategy Evolution and Resolution Deduction in Diplomacy. Master’s Thesis, University of Groningen, Artificial Intelligence (2005)
Calhamer, A.B.: Calhamer on Diplomacy: The Boardgame Diplomacy and Diplomatic History. Authorhouse (1999)
Fàbregues, A., Sierra, C.: Diplomacy game: the test bed (2009), http://www.perada-magazine.eu/view.php?source=1761-2009-08-03
Fàbregues, A., Sierra, C.: A testbed for multiagent systems. Tech. rep., IIIA-CSIC, Bellaterra, Barcelona (October 2009)
Hal, J.v.: Diplomacy AI - Albert (November 20, 2010), http://sites.google.com/site/diplomacyai/albert , http://sites.google.com/site/diplomacyai/
Johansson, S.J.: On using multi-agent systems in playing board games. In: Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2006, pp. 569–576. ACM, New York (2006)
Johansson, S.J., Håård, F.: Tactical coordination in no-press diplomacy. In: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2005, pp. 423–430. ACM, New York (2005)
Kemmerling, M., Ackermann, N., Beume, N., Preuss, M., Uellenbeck, S., Walz, W.: Is human-like and well playing contradictory for diplomacy bots? In: Proceedings of the IEEE Symposium on Computational Intelligence and Games (CIG 2009), pp. 209–216 (2009)
Kraus, S., Lehmann, D.J.: Designing and building a negotiating automated agent. Computational Intelligence 11, 132–171 (1995)
Loeb, D.E.: Challenges in multi-player gaming by computers. The Diplomatic Pouch Zine (S1995M) (1995)
Ribeiro, J., Mariano, P., Seabra Lopes, L.: DarkBlade: A program that plays diplomacy. In: Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M. (eds.) EPIA 2009. LNCS, vol. 5816, pp. 485–496. Springer, Heidelberg (2009)
Shaheed, J.: Creating a Diplomat. Master’s Thesis, Imperial College, London, UK (2004)
Shapiro, A., Fuchs, G., Levinson, R.: Learning a game strategy using pattern-weights and self-play. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 42–60. Springer, Heidelberg (2003)
Webb, A., Chin, J., Wilkins, T., Payce, J., Dedoyard, V.: Automated negotiation in the game of diplomacy (2008), http://www.daide.org.uk/external/TheDiplominator.pdf (November 30, 2010)
Windsor, P.D.: What’s your point. The Diplomatic Pouch Zine (S1999M) (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kemmerling, M., Ackermann, N., Preuss, M. (2011). Nested Look-Ahead Evolutionary Algorithm Based Planning for a Believable Diplomacy Bot. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2011. Lecture Notes in Computer Science, vol 6624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20525-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-20525-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20524-8
Online ISBN: 978-3-642-20525-5
eBook Packages: Computer ScienceComputer Science (R0)