Name
Abstract | ||
|---|---|---|
Alesia is a two-player zero-sum game which is quite similar to the rock-paper-scissors game: the two players simultaneously move and do not know what the opponent plays at a given round. The simultaneity of the moves implies that there is no deterministic good strategy in this game, otherwise one would anticipate the moves of the opponent and easily win the game. We explore how to build a family of one-dimensional stochastic cellular automata to play this game. The rules are built in an iterative way by progressively increasing the complexity of the transitions. We show the possibility to construct a family of rules with interesting results, including a good performance when confronted to the Nash-equilibrium strategy. |
Year | Venue | Field |
|---|---|---|
2018 | ACRI | Computer science,Theoretical computer science,Stochastic cellular automaton,Simultaneity |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
1 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nazim Fatès | 1 | 212 | 25.31 |