A Class Grammar for General Games

The class grammar approach establishes a standardized framework for general game design by automatically generating context-free grammars directly from existing source code hierarchies. By leveraging Java’s reflection and compilation capabilities, this methodology creates a symbolic interface that maps game definitions to underlying implementation logic. This structure effectively decouples high-level game descriptions from complex code, providing a robust, extensible, and evolvable environment suitable for both manual design and automated, computer-assisted development.

This framework prioritizes simplicity and clarity, addressing the limitations inherent in traditional Game Description Languages. By parsing class constructors and their parameters, the system ensures that game definitions remain concise while maintaining a precise, one-to-one relationship with the underlying software architecture. This approach facilitates greater portability and performance, as the system can dynamically compile game rules at runtime without requiring manual updates to the grammar whenever the underlying code library evolves.

Comparative analysis of game definitions, such as Tic-Tac-Toe, demonstrates the efficiency of this model. When measured against established standards like ZRF, Stanford GDL, and previous iterations of Ludii GDL, the class grammar requires significantly fewer tokens to define complex game states. By categorizing game components, rules, and metadata into a formal, structured hierarchy, this method provides a superior balance of brevity and descriptive power. Ultimately, this approach offers a scalable solution for general game systems, enabling researchers and developers to define, analyze, and iterate upon a vast array of games with minimal overhead and maximum structural integrity.