Surprising strategies obtained by stochastic optimization in partially observable games

07/05/2018
by   Marie-Liesse Cauwet, et al.
0

This paper studies the optimization of strategies in the context of possibly randomized two players zero-sum games with incomplete information. We compare 5 algorithms for tuning the parameters of strategies over a benchmark of 12 games. A first evolutionary approach consists in designing a highly randomized opponent (called naive opponent) and optimizing the parametric strategy against it; a second one is optimizing iteratively the strategy, i.e. constructing a sequence of strategies starting from the naive one. 2 versions of coevolutions, real and approximate, are also tested as well as a seed method. The coevolution methods were performing well, but results were not stable from one game to another. In spite of its simplicity, the seed method, which can be seen as an extremal version of coevolution, works even when nothing else works. Incidentally, these methods brought out some unexpected strategies for some games, such as Batawaf or the game of War, which seem, at first view, purely random games without any structured actions possible for the players or Guess Who, where a dichotomy between the characters seems to be the most reasonable strategy. All source codes of games are written in Matlab/Octave and are freely available for download.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/02/2018

Zero-determinant strategies in repeated incomplete-information games: Consistency of payoff relations

We derive zero-determinant strategies for general multi-player multi-act...
research
05/30/2023

Steering control of payoff-maximizing players in adaptive learning dynamics

Evolutionary game theory provides a mathematical foundation for cross-di...
research
07/08/2016

Learning opening books in partially observable games: using random seeds in Phantom Go

Many artificial intelligences (AIs) are randomized. One can be lucky or ...
research
07/07/2021

A Formula for Designing Zero-Determinant Strategies

A formula is presented for designing zero-determinant(ZD) strategies of ...
research
02/24/2020

Efficient exploration of zero-sum stochastic games

We investigate the increasingly important and common game-solving settin...
research
03/21/2021

Collaborative Agent Gameplay in the Pandemic Board Game

While artificial intelligence has been applied to control players' decis...
research
05/24/2023

Guessing Winning Policies in LTL Synthesis by Semantic Learning

We provide a learning-based technique for guessing a winning strategy in...

Please sign up or login with your details

Forgot password? Click here to reset