[KongchangAI]
ConceptExpectimax搜索 / Expectimax算法

Expectimax

A game-tree search algorithm and variant of Minimax designed for decision-making scenarios involving random events. It maximizes value at player nodes and computes expected values at chance nodes, making it suitable for games with stochastic elements such as 2048.

Timeline (last 90 days)

Oct 12

A developer attempted to build a 2048 game auto-solver using a genetic algorithm combined with Expectimax search; the current implementation can reach the 2048 tile in 30% to 50% of games.

Unverified50%
Oct 12

Expectimax is more suitable than Minimax for 2048 because new tiles in 2048 are randomly generated and there is no opponent's will; Expectimax takes the maximum value at player decision nodes and the expected value at random generation nodes.

Unverified50%
Oct 12

The role of genetic algorithms in 2048 solvers is typically to optimize the weights of each feature in the Expectimax evaluation function.

Unverified50%
Oct 12

64-bit integer encoding is a performance optimization rather than an effectiveness optimization; it does not directly improve the win rate, but is a prerequisite for achieving search depths of 4 or 5.

Unverified50%
Oct 12

Increasing the Expectimax search depth is a means of directly affecting the win rate, but the computational cost increases exponentially as depth increases.

Unverified50%

All Facts (5)

Source Articles