Physics
Football Kick: Compressing a Penalty Shootout into an Angle-by-Power Judgement Table
A 5-round penalty duel compressed into an angle-by-power table: three judgement bands — miss zone, risk zone, sweet spot — rule goal, save or miss.
Numbers
Gacha Simulation: Understanding Pity Mechanics and Probability Psychology
This article deconstructs the structural differences between hard and soft pity systems, analyzing how probability psychology creates perceptual bias. Through simulation verification of gacha data, we reveal the impact of emotional thresholds on decision-making. This helps developers quantify the risks of pity strategies and optimize numerical design to enhance user retention and willingness to pay.
GridPhysics
Grid Movement and Collision: From Rules to Implementation
This article deconstructs the layered mechanism for grid-based movement and collision detection, built upon grid coordinates and physics tags. It details the push-box displacement logic and blockage checks using an occupancy table and reachability model, providing a direct technical path from rule definition to code implementation to help readers master core physics interaction principles.
ClickIdle
Infinite Progression: Balancing Exponential Cost Curves and Simulated Infinity
This guide deconstructs cost scaling and milestone thresholds in clicker/idle games to implement sustainable 'simulated infinity.' By combining non-linear cost growth with periodic system unlocks and prestige mechanics, developers can maintain player engagement without triggering late-game collapse, offering a high-execution framework for solving retention issues in pseudo-infinite loops.
MatchLevels
Match-3 Mechanics: Crafting Satisfaction via Score Curves and Constraint Strategies
This guide dissects the non-linear mapping between chain length and score in match-3 games, detailing technical implementations for blocking infinite chains through dynamic generation and movement constraints. It further explains how to calibrate feedback timing to sustain player engagement, equipping developers with tools for numerical balancing and level pacing.
MatchLevels
Match-3: Leveraging Elimination Mechanics to Drive Retention and Pacing
A deep dive into Match-3 core mechanics, focusing on the intensity stratification logic for 3/4/5-match eliminations. Through quantitative analysis of satisfying elimination triggers and dynamic checkpoint control strategies, we reveal how to drive user retention via rule design. Content covers constrained random generation algorithms and level pacing, aiming to help developers build high-engagement elimination experiences and improve game balance.
MergeIdle
Merge Evolution: Designing Merge Chains and Strategic Blockers
A deep dive into the Merge Evolution mechanic, breaking down hierarchical chain design and rarity drop mechanics. We quantify the numerical balance of blockers and unlock thresholds, offering controlled pacing strategies to prevent player churn and build high-retention merge chains.
FeaturedMerge
Core Mechanics of Merge & Upgrade Systems
A deep dive into merge and upgrade mechanics, breaking down merge rules, production pacing, and in-game feedback loops. The article outlines the implementation path from gameplay goals to core loops, offering reusable data structures and key numerical design principles to help developers build accessible, high-growth idle merge systems.
RoguelikeLevels
Failure as Progress: Balancing Permanent Growth and Anti-Farm Mechanics
A deep dive into Roguelike permanent growth scaling and anti-farming systems. Learn how to balance rhythm-based unlocks and numerical feedback to transform player frustration into a compelling progression loop, ensuring a fair and engaging strategy space.
LevelsPuzzle
Multiple Endings: Trigger Conditions and Player Path Guidance
A deep dive into crafting multiple ending triggers and player path guidance systems. By quantifying core elements, we define clear completion thresholds, build a tiered hint system ranging from strong to no guidance, and design dynamic feedback to balance exploration freedom, helping developers efficiently construct multi-ending narrative structures.
FeaturedPuzzle
One-Line Drawing: Graph Generation Algorithms and Difficulty Scaling
Deep dive into the mechanics of one-line drawing puzzles: using Euler path logic to validate solvability and controlling node degrees to generate unsolvable or single-solution levels. Systematically explains how branching points and loops quantify difficulty, demonstrating how algorithms dynamically add misleading edges to boost challenge. Readers will master graph theory applications in level generation and learn to build playable, clearly tiered puzzles.
DodgePuzzle
Pacman City: Turning "Dodge the Ghosts" into Timed Route Planning
120 seconds, 3 lives, 323 dots: eat and dodge through a block-city maze, where the 8-second power-pellet reversal is the only rhythm switch that matters.
Page 1 of 4 · 39 posts