PulseAugur
EN
LIVE 15:33:57

AI researcher seeks algorithms for stochastic merge puzzle with previewed events

A user is seeking guidance on developing an AI for a stochastic single-player merge puzzle game. The game features a larger action space than 2048, stack constraints, and a unique mechanic where upcoming random tile drops are previewed one move in advance. The user has a simulator and is looking for algorithms, papers, or implementations to learn values and policies, focusing on maximizing merged tiles over a long horizon or within a time limit. AI

IMPACT This query may lead to novel approaches in planning and reinforcement learning for games with stochastic elements and lookahead capabilities.

RANK_REASON User is asking for help with a specific technical problem related to game AI, not announcing a new development.

Read on r/MachineLearning →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

AI researcher seeks algorithms for stochastic merge puzzle with previewed events

COVERAGE [1]

  1. r/MachineLearning TIER_1 English(EN) · /u/CaiwenGong ·

    Planning/RL for a stochastic single-player merge puzzle: afterstates, previewed chance events, and long-horizon throughput [D]

    <!-- SC_OFF --><div class="md"><p>I am working on an AI for a small single-player merge puzzle and would appreciate pointers to related algorithms, papers, or existing implementations. It resembles 2048 in its action -&gt; afterstate -&gt; random event structure, but has a larger…