相关论文: Game of Life on Phyllosilicates: Gliders, Oscillat…
Game balancing is an important part of the (computer) game design process, in which designers adapt a game prototype so that the resulting gameplay is as entertaining as possible. In industry, the evaluation of a game is often based on…
Object selection refers to the mechanism of extracting objects of interest while ignoring other objects and background in a given visual scene. It is a fundamental issue for many computer vision and image analysis techniques and it is still…
Finite turn-based safety games have been used for very different problems such as the synthesis of linear temporal logic (LTL), the synthesis of schedulers for computer systems running on multiprocessor platforms, and also for the…
We consider a stochastic game of control and stopping specified in terms of a process $X_t=-\theta \Lambda_t+W_t$, representing the holdings of Player 1, where $W$ is a Brownian motion, $\theta$ is a Bernoulli random variable indicating…
Recently we introduced a model of symbiosis, Model-S, based on the evolution of seed patterns in Conway's Game of Life. In the model, the fitness of a seed pattern is measured by one-on-one competitions in the Immigration Game, a two-player…
Evolutionary games on graphs describe how strategic interactions and population structure determine evolutionary success, quantified by the probability that a single mutant takes over a population. Graph structures, compared to the…
We present a novel algorithm for game-theoretic trajectory planning, tailored for settings in which agents can only observe one another in specific regions of the state space. Such problems arise naturally in the context of multi-robot…
The Rock-Paper-Scissors (RPS) game and its generalizations with ${\cal S}>3$ species are well studied models for cyclically interacting populations. Four is, however, the minimum number of species that, by allowing other interactions beyond…
We elucidate that the nearly phase-ordered active XY spins in contact with a conserved, diffusing species on a substrate can be stable. For wide-ranging model parameters, it has stable uniform phases robust against noises. These are…
This paper introduces Differentiable Logic Cellular Automata (DiffLogic CA), a novel combination of Neural Cellular Automata (NCA) and Differentiable Logic Gates Networks (DLGNs). The fundamental computation units of the model are…
We present a strong theoretical foundation that frames a well-defined family of outer-totalistic network automaton models as a topological generalisation of binary outer-totalistic cellular automata, of which the Game of Life is one notable…
We analyze a probabilistic cellular automaton describing the dynamics of coexistence of a predator-prey system. The individuals of each species are localized over the sites of a lattice and the local stochastic updating rules are inspired…
For any infinite transitive sofic shift $X$ we construct a reversible cellular automaton (i.e. an automorphism of the shift $X$) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing…
We consider a system of spinless fermions in a nearly one-dimensional cylindrical trap, with the Fermi level such that only the lowest-lying states with angular momenta l = +hbar, 0, or -hbar about the axis of the trap are occupied. We…
We present what we argue is the generic generalization of Conway's "Game of Life" to a continuous domain. We describe the theoretical model and the explicit implementation on a computer.
The Wigner localization is an electron phase at low densities when the electrons are sharply localized around equilibrium positions. The simulation of the Wigner localization phenomenon requires careful treatment of the many-body…
Many of the large structures of the cell, such as the cytoskeleton, are assembled and maintained far from equilibrium. We study the stabilities of various structures for a simple model of such a far-from-equilibrium organized assembly in…
We present a novel form of Liquid Automata, using this to simulate autopoiesis, whereby living machines self-organise in the physical realm. This simulation is based on an earlier Cellular Automaton described by Francisco Varela. The basis…
We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…
Global games form a subclass of games with incomplete information where a set of agents decide actions against a regime with an underlying fundamental $\theta$ representing its power. Each agent has access to an independent noisy…