Nested Look-Ahead Evolutionary Algorithm Based Planning for a Believable Diplomacy Bot

نویسندگان

  • Markus Kemmerling
  • Niels Ackermann
  • Mike Preuss
چکیده

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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Migrating Birds Optimization: A New Meta-heuristic Approach and Its Application to the Quadratic Assignment Problem

A Study on the Mutation Rates of a Genetic Algorithm Interacting with a Sandpile p. 32 On the Design of Boolean Network Robots p. 43 EvoGames Contributions Multiple Tree for Partially Observable Monte-Carlo Tree Search p. 53 Evolving Interesting Maps for a First Person Shooter p. 63 Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo p. 73 Nested Look-Ahead Evolutionary Algorithm Bas...

متن کامل

A multi-objective evolutionary approach for integrated production-distribution planning problem in a supply chain network

Integrated production-distribution planning (PDP) is one of the most important approaches in supply chain networks. We consider a supply chain network (SCN) to consist of multi suppliers, plants, distribution centers (DCs), and retailers. A bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

متن کامل

Diagnosis and Repair Iteration Planning versus N-Step Look Ahead Planning

In this paper we compare the performance of planning algorithms distinguishing and iterating between observation (diagnosis) and repair (action) phases with algorithms extending conventional planning methods with observations using n-step look ahead. Diagnosis and repair iteration planning algorithms are an extension of earlier work of Friedrich and Nejdl, n-step look ahead planning including d...

متن کامل

A Look-Ahead B&B Search for Cost-Based Planning

This paper focuses on heuristic cost-based planning. We propose a combination of a heuristic designed to deal with this planning model together with the usage of look-ahead states based on relaxed plans to speed-up the search. The search algorithm is a modified Best-First Search (BFS) performing Branch and Bound (B&B) to improve the last solution found. The objective of the work is to obtain a ...

متن کامل

Nested Lanczos : Implicitly Restarting a Lanczos Algorithm Nested Lanczos : Implicitly Restarting a Lanczos Algorithm

In this text, we present a generalisation of the idea of the Implicitly Restarted Arnoldi method to the nonsymmetric Lanczos algorithm, using the two-sided Gram-Schmidt process or using a full Lanczos tridi-agonalisation. The Implicitly Restarted Lanczos method can be combined with an implicit lter. It can also be used in case of breakdown and ooers an alternative for look-ahead.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011