Game Board Upgrade Path Determination for Match-3 Puzzles
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Designing algorithms for computer games that involve selecting and switching adjacent tiles to form sequences of matching characteristics poses challenges in determining upgrade paths and level characteristic values, especially in responding to user input and displaying game mechanics effectively.
Innovation Solution
A computer-implemented method and apparatus that retrieve information about game objects, identify match conditions, determine upgrade paths based on action characteristics, and update level characteristic values, allowing for the display of game objects moving along these paths and indicating their levels, which can increment and change based on predefined values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the algorithm determines upgrade paths and level characteristic values for game objects, then the gameplay experience and user engagement are enhanced, but the device complexity and computational requirements increase
Solution Approach 1:
The algorithm segments the game board into distinct upgrade paths and identifies specific game objects positioned on these paths. By dividing the complex task of evaluating all possible moves into focused upgrade path determination, the system enhances gameplay feedback without proportionally increasing overall computational complexity.
Solution Approach 2:
The system performs preliminary determination of upgrade paths and level characteristic values before the user completes their next move. This advance calculation allows the system to prepare and display upgrade information seamlessly, enhancing user experience without adding computational burden during critical gameplay moments.
2Ease of operation
If the system displays game objects moving along upgrade paths with level indicators, then user engagement and clarity of level progression are improved, but the display complexity and rendering requirements increase
Solution Approach 1:
The system uses visual indicators such as color changes and graphical representations to display level characteristic values and upgrade paths. These visual cues provide clear feedback to users about game state and progression without requiring complex display hardware or overwhelming visual information.
Solution Approach 2:
The display system shows upgrade path information and level indicators selectively for game objects positioned on determined upgrade paths, rather than displaying all possible information. This partial display approach maintains user engagement with relevant information while avoiding display complexity from showing every possible game state simultaneously.
3Adaptability or versatility
If the algorithm increments level characteristic values and determines subsequent upgrade paths, then the game mechanics and progression system are enhanced, but the computational time and processing requirements increase
Solution Approach 1:
The algorithm automatically increments level characteristic values and determines subsequent upgrade paths without requiring additional user input or manual intervention. This self-service approach allows the game to progress naturally through level increments while minimizing the time users spend waiting for system processing.
Solution Approach 2:
The system performs upgrade path determination and level incrementing at periodic intervals based on game events such as when game objects are positioned on upgrade paths or when matches are made. This periodic execution pattern optimizes computational timing, enhancing game mechanics while minimizing unnecessary processing during non-critical moments.
Data Source
AI summary
A computer implemented method of providing a game, comprising at least one processor and at least one memory of a device, retrieving from at least one memory information associated with a plurality of first objects and one or more characteristics of said first objects and causing said objects with said one or more characteristics to be displayed on a first area of a display in an arrangement, executing an algorithm which identifies a match condition between said first objects in which at least one of said objects comprises an action characteristic, determines at least one upgrade path in the arrangement in dependence on the action characteristic and determines if at least one first object comprising an action characteristic is positioned on the at least one upgrade path and, if so, determines a level characteristic value of said at least one first object positioned on the determined upgrade path.