Abstract
The video game industry has grown to become one of the largest in the market, surpassing even the film industry over a decade ago (Statista in Video game industry revenue worldwide 2000–2020). However, the development of games designed with visually impaired players in mind is still almost non-existent when compared to the sheer number of games released yearly. NonVisual Pong is our approach to addressing this challenge, providing blind players with a way to engage in competitive fun through gaming. We took the original Pong game from 1972 and fully adapted it to be played using only a controller—no visual display required. Following the development process, we tested our implementation with experts, discovering that, overall, our game was easy to pick up, required no overly complex setup, and successfully delivered the intended experience. Players enjoyed a balanced challenge and immersion, facilitated by audio cues and the controller’s vibrations. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.

Abstract
The stochastic dynamic inventory-routing problem (SDIRP) is a fundamental problem within supply chain operations that integrates inventory management and vehicle routing while handling the stochastic and dynamic nature of exogenous factors unveiled over time, such as customer demands, inventory supply and travel times. While practical applications require dynamic and stochastic decision-making, research in this field has only recently experienced significant growth, with most inventory-routing literature focusing on static variants. This paper reviews the current state of research on SDIRPs, identifying critical gaps and highlighting emerging trends in problem settings and decision policies. We extend the existing inventory-routing taxonomies by incorporating additional problem characteristics to better align models with real-world contexts. As a result, we highlight the need to account for further sources of uncertainty, multiple-supplier networks, perishability, multiple objectives, and pickup and delivery operations. We further categorize each study based on its policy design, investigating how different problem aspects shape decision policies. To conclude, we emphasize that large-scale and real-time problems require more attention and can benefit from decomposition approaches and learning-based methods.

Abstract
Since the publication of the 2020 paper, Finding the Gaps About Uses of Immersive Learning Environments: A Survey of Surveys, the landscape of immersive learning environments (ILEs) has continued to evolve rapidly. This update aims to revisit the gaps identified in that previous research and explore emerging trends. We conducted an extensive review of new surveys published after that paper's cut date. Our findings reveal a significant amount of new published reviews (n = 64), more than doubling the original corpus (n = 47). The results highlighted novel themes of usage of immersive environments, helping bridge some 2020 research gaps. This paper discusses those developments and presents a consolidated perspective on the uses of immersive learning environments.

Abstract
The staggered model is a recent, very general variant of discrete-time quantum walks which, avoiding the use of a coin to direct the walker evolution, explores the underlying graph structure to build an evolution operator based on local unitaries induced by adjacent vertices. Optimising their implementation to increase resilience to decoherence phenomena motivates their analysis with the ZX-calculus. The whole optimisation can be seen as a graph reconfiguration process along which the original circuit is rewrote, significantly reducing the number of (expensive) gates used. The exercise identified an underlying pattern leading to an alternative, potentially more efficient evolution operator.

Abstract
This paper introduces Paraconsistent Reactive Graphs, as an extension of Reactive graphs that incorporates paraconsistency into the ground edges to address vagueness and inconsistency within dynamic systems. By assigning pairs of truth values to ground edges, this framework captures the uncertainty and contradictions stemming from incomplete or conflicting information. We explore the semantics of these graphs and provide a practical example to illustrate the proposed approach.

Abstract
In this paper, we introduce a novel approach for rigorously verifying safety properties of state machine specifications. Our method leverages an auto-active verifier and centers around the use of action functions annotated with contracts. These contracts facilitate inductive invariant checking, ensuring correctness during system execution. Our approach is further supported by the Why3-do library, which extends the Why3 tool's capabilities to verify concurrent and distributed algorithms using state machines. Two distinctive features of Why3-do are: (i) it supports specification refinement through refinement mappings, enabling hierarchical reasoning about distributed algorithms; and (ii) it can be easily extended to make verifying specific classes of systems more convenient. In particular, the library contains models allowing for message-passing algorithms to be described with programmed handlers, assuming different network semantics. A gallery of examples, all verified with Why3 using SMT solvers as proof tools, is also described in the paper. It contains several auto-actively verified concurrent and distributed algorithms, including the Paxos consensus algorithm.