Boogu Arena: Interaction Dynamics

• Boogu Arena is a bounded interaction space where local rules generate global descriptors, such as Laplacian spectral fingerprints or exact victory probabilities.
• In swarm robotics, the arena is defined by physical boundaries and employs diffusion dynamics and spectral graph theory to infer environmental geometry.
• In probabilistic game analysis, the arena abstraction converts combat into dynamic programming recurrences to compute victory probabilities from local attack outcomes.

The arXiv literature relevant to arena-centered computation presents two technically distinct uses of the term arena. In swarm robotics, the arena is a bounded physical domain whose geometry can be inferred from the Laplacian eigenspectrum induced by local communication among robots (Cazenille et al., 2024). In probabilistic game analysis, the arena is a stylized single-combat environment in Fire Emblem, where victory probability is computed exactly through multivariate recurrences and dynamic programming (Brockmann, 2018). Taken together, these works suggest an arena as a constrained interaction space in which local rules generate globally informative observables: spectral fingerprints in one case, and exact absorbing probabilities in the other.

1. Arena as a constrained interaction domain

In the swarm-robotic formulation, the arena is a spatial domain that constrains diffusion. The central claim is that a robot swarm can infer the geometry of the arena it occupies by locally emulating diffusion and then reading out the spectral signature of that diffusion. The continuous model is the diffusion equation

$\frac{\partial s}{\partial t} = \kappa \nabla^2 s,$

with

$$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$

and the key observation is that the geometry of a domain can generally be reconstructed from the eigenspectrum of its Laplacian (Cazenille et al., 2024). This is the basis for the paper’s “hearing the shape” analogy: the swarm does not directly sense the boundary, but rather infers shape from relaxation dynamics.

In the Fire Emblem formulation, the arena is not geometric but stochastic and turn-based. Terrain, positioning, reinforcements, and weapon choice are ignored, and the fight is represented entirely by hit probabilities, damage per attack, critical-hit probabilities, and possible follow-up attacks. The battle continues until one combatant dies, and the state is parameterized not by full HP values alone but by the number of regular attacks required to defeat each combatant (Brockmann, 2018). This abstraction converts the arena into a finite state space amenable to exact recurrence analysis.

A plausible implication is that both uses of the term arena emphasize boundedness more than physicality. In one setting the boundary is literal and geometric; in the other it is induced by absorbing death states. In both cases, the arena defines the admissible trajectories of an interaction process.

2. Spectral swarm robotics and arena-shape recognition

The swarm-robotic approach introduces spectral swarm robotics as a distributed method for computing a spectral fingerprint of the environment using only local interactions. The robots discretize the continuous domain into a graph $\mathcal{G}$ whose nodes are robots and whose edges are communication links. Diffusion on this graph is governed by

$$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$

and, in discrete time,

$$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$

or equivalently

$s^{n+1}=s^{n}-c\tau Ls^{n},$

where $L$ is the graph Laplacian (Cazenille et al., 2024). The paper defines $L_{i,i}$ as the number of neighbors of robot $i$, $L_{i,j}=-1$ if $$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$0 and $$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$1 are neighbors, and $$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$2 otherwise.

For small $$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$3, the evolution is approximated by

$$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$4

and decomposes spectrally as

$$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$5

Because the smallest eigenvalue is always $$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$6, the long-time nontrivial decay is governed by the second smallest eigenvalue $$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$7, yielding

$$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$8

This $$\nabla^2 = \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2},$$9 is the algebraic connectivity, or Fiedler value, and it is the main geometric descriptor extracted by the swarm.

The method’s conceptual significance is that shape recognition is not based on direct sensing of walls or global map building. Instead, it is based on how the swarm’s communication graph mixes information. The paper gives the disk-versus-annulus contrast as an example: a disk tends to have higher connectivity and therefore larger $\mathcal{G}$0 than an annulus of the same surface area, because the annulus has a bottleneck-like structure that slows diffusion. The supplementary text formalizes the connection through the Cheeger inequalities,

$\mathcal{G}$1

which link bottlenecks, diffusion, and spectral gap (Cazenille et al., 2024).

A common misconception is that the robots are reconstructing a geometric map. They are not. The reported procedure is to spread out, repeatedly diffuse an internal value, estimate $\mathcal{G}$2 from the decay rate, reach consensus, and classify the arena by comparing the consensus estimate to learned centroids.

3. Local interaction rule, estimation pipeline, and scaling law

The robot-local update rule is exactly the discrete diffusion law above. Two robots are neighbors if they can communicate within their field of perception $\mathcal{G}$3, and this induces the adjacency matrix $\mathcal{G}$4. Because real Kilobot communication can be asymmetric and unreliable, the experimental algorithm includes a handshake stage to identify stable bidirectional neighbors (Cazenille et al., 2024).

The implementation details are specific. Robots start with $\mathcal{G}$5. The swarm first performs a pre-diffusion session to estimate and correct the initial mean so that the resulting state has zero mean, ensuring that the dynamics decay along $\mathcal{G}$6. During each diffusion step, robots broadcast their current value and update from received neighbor values. The code uses a diffusion step duration $\mathcal{G}$7, a diffusion rate $\mathcal{G}$8, and a burn-in period $\mathcal{G}$9 before slope estimation. Each robot estimates its own $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$0 by fitting the slope of $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$1 over time; these estimates are then averaged via collective averaging to obtain $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$2, and the swarm averages across iterations to obtain $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$3.

A central empirical result is a universal scaling law for best-performing parameter pairs $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$4:

$$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$5

where $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$6 is the number of robots, $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$7 is the arena surface, and $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$8 is the area of one robot’s perception disk. The paper identifies three notable boundaries. The best-performing region lies on the hyperbola $$\frac{d s_i}{d t} = c \sum_{j=1}^N A_{i,j}(s_j-s_i),$$9. The lower boundary $$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$0 separates disconnected graphs below the curve from one-component graphs above it. The upper boundary $$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$1 separates convergent diffusion from over-connected, unstable graphs (Cazenille et al., 2024).

The stated intuition is operationally important. If $$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$2 is too large relative to robot spacing, the graph becomes too dense and the shape’s details are lost; if $$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$3 is too small, connectivity drops and information cannot propagate. The authors relate this to the spacing scale

$$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$4

arguing that $$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$5 must be tuned relative to $$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$6. The supplementary discussion contrasts this empirical scaling with Singer’s graph-Laplacian convergence result

$$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$7

as written in the paper, and notes that the observed classification scaling differs because the task is not merely Laplacian approximation but classification in bounded, hard-walled arenas.

4. Experimental validation, challenge conditions, and limitations

The simulation study extends to up to 550 robots and seven arena shapes: disk, square, arrow, star, triangle, stop, and annulus. In the seven-shape case, the best-performing region is around the optimal scaling hyperbola $$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$8, and after 30 iterations the system can classify the shapes very well. The paper reports r1 and r3 as respectively 100% and 86% accurate classification in the seven-shape scenario. In the disk-versus-annulus setting designed to mirror the physical experiment, simulation reaches about 95% accuracy over 64 runs (Cazenille et al., 2024).

The physical validation uses 25 Kilobots and two arenas: a disk and an annulus. The disk has radius $$s_i^{n+1}=s_i^{n}+c\tau\sum_{j=1}^N A_{ij}(s_j^{n}-s_i^{n}),$$9 mm and area $s^{n+1}=s^{n}-c\tau Ls^{n},$0. The annulus has outer radius $s^{n+1}=s^{n}-c\tau Ls^{n},$1 mm, inner radius $s^{n+1}=s^{n}-c\tau Ls^{n},$2 mm, and area $s^{n+1}=s^{n}-c\tau Ls^{n},$3. The experimental setup includes black curtains to block external light, overhead cameras, uniform lighting, a white matte floor, and, for the annulus, a black disk obstacle to physically prevent communication between robots on opposite sides of the annulus. The robots are initially placed randomly but broadly uniformly, then execute the sequence: run-and-tumble dispersion, stop and diffuse, estimate $s^{n+1}=s^{n}-c\tau Ls^{n},$4 locally, perform collective averaging, and display a color corresponding to the predicted arena. The experimental controller is the same as in simulation through the Kilombo framework. Classification is one-shot in the sense that a single diffusion-and-consensus estimate suffices, and the supplementary material specifies a nearest centroid classifier based on $s^{n+1}=s^{n}-c\tau Ls^{n},$5; the LED colors are cyan for disk and violet for annulus. The reported experimental accuracy is 73% over 30 runs with 15 runs per arena (Cazenille et al., 2024).

The challenge conditions are explicit: small swarm size, slow and noisy Kilobot communication, asymmetric and unreliable links, finite message size, clock desynchronization, possible diffusion divergence, low communication rates, and only a rough estimate of $s^{n+1}=s^{n}-c\tau Ls^{n},$6 in experiments. The authors attribute robustness to the smoothing effect of diffusion and to neighbor influence correcting individual mistakes.

The limitations are equally explicit. The method assumes synchronous stages using a shared time counter, communication within a field of perception $s^{n+1}=s^{n}-c\tau Ls^{n},$7, LED display capability, floating-point operations, and sufficiently dispersed initial conditions. Failure modes include over-connected graphs, disconnected graphs, communication asymmetry, and clock drift. The paper also notes the theoretical caveat that different shapes can share the same spectrum, and that the physical experiments currently cover only disk versus annulus. In the current implementation, robots must be immobile during diffusion and moving during the random-walk stage. These details matter because they delimit what the spectral approach does and does not presently establish.

5. Fire Emblem arena as an exact stochastic recurrence problem

In the Fire Emblem arena model, the problem is to compute the player’s probability of victory in a single-combat probabilistic process. The combat parameters are the player’s true hit probability $s^{n+1}=s^{n}-c\tau Ls^{n},$8, critical-hit probability conditional on a hit $s^{n+1}=s^{n}-c\tau Ls^{n},$9, and regular damage $L$0, together with the enemy’s corresponding parameters $L$1, $L$2, and $L$3. The state variables are

$L$4

the numbers of regular enemy and player attacks needed to defeat the player and enemy, respectively, when no crits are involved (Brockmann, 2018).

The basic recurrence without critical hits and without follow-up attacks defines $L$5 as the player victory probability:

$L$6

Solving for $L$7 yields

$L$8

The boundary conditions are

$L$9

In particular, $L_{i,i}$0 because the player attacks first and simultaneous lethal outcomes are resolved in the player’s favor.

With critical hits, a critical hit deals triple normal damage, so a crit subtracts $L_{i,i}$1 from the remaining-hit count. The recurrence expands over miss, normal hit, and critical hit outcomes for both combatants:

$L_{i,i}$2

$L_{i,i}$3

$L_{i,i}$4

An important modeling point is that $L_{i,i}$5 and $L_{i,i}$6 are conditional crit rates given a hit, so the probability that the player crits is $L_{i,i}$7, not merely $L_{i,i}$8.

Follow-up attacks produce two additional regimes. If the enemy attacks twice per round, the player’s victory probability is denoted $L_{i,i}$9, and after isolating the “all attacks miss” term the coefficient of $i$0 becomes

$i$1

If instead the player can attack twice, the paper avoids a direct bulky recurrence by reducing the problem to the enemy-follow-up case with roles swapped:

$i$2

This reduction is accompanied by an auxiliary function

$i$3

which is needed if one writes the direct recurrence and must prevent impossible post-death action sequences (Brockmann, 2018).

A common misconception is that the hit rate shown in-game can be inserted directly into these formulas. The paper explicitly rejects this for most games: the algorithm requires true hit probabilities, not displayed hit rates.

6. Dynamic programming, numerical issues, and cross-domain significance

The Fire Emblem recurrences are converted into dynamic programming by noting that each state depends only on previously computed states. For the basic case, the paper proposes an $i$4 table and fills it in increasing order of indices. Because each entry requires only constant work, the time complexity is

$i$5

and the space complexity is also $i$6. Using the HP-to-hits conversion, the runtime is also written as

$i$7

Generalized recurrences can reference negative indices such as $i$8, and the implementation handles this by clamping negative indices to $i$9 before table lookup (Brockmann, 2018).

The implementation notes are unusually concrete. If $L_{i,j}=-1$0, the battle never ends. If only one combatant can deal damage, that combatant is a guaranteed winner, so no recurrence is needed. To avoid floating-point accumulation error, the implementation stores intermediate results as fractions, converting to decimal only at the end and also returning the exact fraction form. The paper further notes that a full implementation is provided in Python 2.7+, with Windows and Linux executables built via PyInstaller, and that features such as healing would destroy the monotonicity required for simple bottom-up DP; in that case one might instead build a system of $L_{i,j}=-1$1 linear equations and solve it via Gaussian elimination.

The true-hit correction is especially important. In the first five games, displayed hit is accurate. In most games from Binding Blade through Awakening, the system uses 2RN, where two random numbers are generated and averaged; displayed hit rates below 50 are overstated and rates 50 and above are understated, with the paper’s example that a displayed 99% corresponds to a true hit of 99.99%. In Fire Emblem Fates, hit rates below 50% appear accurate, while for 50% and above the weighted average $L_{i,j}=-1$2 is used instead of a plain average. These details are not peripheral implementation trivia; they determine the probabilistic parameters of the recurrence itself (Brockmann, 2018).

Taken together, the two papers exhibit a shared computational structure despite their very different subject matter. In the swarm setting, local exchanges induce a graph Laplacian whose eigenspectrum carries global geometric information. In the combat setting, local attack outcomes induce an acyclic recurrence whose solution yields a global victory probability. This suggests a broader analytic motif for arena-based systems: the arena is a constrained medium in which local transition rules, whether diffusive or combat-based, can be transformed into exact or approximate global descriptors.