Fillable Symbol Position Patterns for Memory-Efficient Game Variation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing electronic gaming machines lack dynamic symbol position patterns that can enhance game variations without significantly increasing memory or computational resources, limiting the diversity and engagement of gaming experiences.
Innovation Solution
Implement a data structure that randomly selects from a plurality of symbol position patterns, modifying the display to indicate occupied positions until a designated pattern is filled, triggering an award.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple symbol position patterns are implemented to enhance game diversity, then game engagement and variety improve, but memory and computational resources increase
Solution Approach 1:
The symbol set is divided into multiple symbol groups, where each group contains a subset of symbols that can form complete winning combinations. Instead of storing all possible symbol positions, the system segments the symbol space into manageable groups that can be randomly selected and combined during gameplay, reducing overall memory requirements while maintaining game diversity.
Solution Approach 2:
The symbol position patterns are made dynamic through random selection of symbol groups and random determination of winning combinations. The system randomly selects which symbol groups to use in each game instance and randomly determines which combinations win, creating varied gameplay experiences without requiring pre-computation or storage of all possible pattern variations.
2Adaptability or versatility
If multiple symbol position patterns are implemented to enhance game variations, then gameplay diversity improves, but device complexity increases
Solution Approach 1:
The data structure is segmented into symbol groups rather than maintaining a single comprehensive symbol position pattern. Each symbol group is a self-contained subset that can be independently selected and processed, simplifying the overall data structure while enabling multiple game variations through different group combinations.
Solution Approach 2:
Symbol groups are pre-defined and stored in a simplified format, but the actual winning combinations and their positions are determined randomly during gameplay. This preliminary organization of symbols into groups reduces data structure complexity while still enabling diverse game variations through runtime random selection.
3Reliability
If random symbol selection is used to determine game outcomes, then fairness is maintained, but predictability and player control are reduced
Solution Approach 1:
The system uses dynamic random selection of symbol groups and random determination of winning combinations to maintain fairness. The randomness ensures that each game instance is unpredictable and fair, while the structured approach of using predefined symbol groups provides a consistent framework for gameplay.
Data Source
AI summary
A technique for using symbol position patterns includes performing a selection operation, using the random number generator and a data structure comprising a plurality of symbol position patterns to obtain one of the symbol position patterns, and modifying display of the plurality of symbol positions in accordance with the selected symbol position pattern. A symbol selection instance is performed using a lookup table comprising a plurality of reel strips, wherein the reel strips include a designated symbol with respect to the plurality of symbol positions until an end condition is met, and upon all the symbol positions of the selected symbol position pattern being occupied by the designated symbol when the end condition is met, an outcome is determined.