2048-solver and 2048-AI-Solvers
Maintenance
0/25
Adoption
7/25
Maturity
16/25
Community
9/25
Maintenance
0/25
Adoption
3/25
Maturity
8/25
Community
13/25
Stars: 28
Forks: 3
Downloads: —
Commits (30d): 0
Language: C++
License: MIT
Stars: 4
Forks: 2
Downloads: —
Commits (30d): 0
Language: C++
License: —
Stale 6m
No Package
No Dependents
No License
Stale 6m
No Package
No Dependents
About 2048-solver
qpwoeirut/2048-solver
A set of AIs for the 2048 tile-merging game. Includes an expectimax strategy that reaches 16384 with 34.6% success and an ML model trained with temporal difference learning.
This project offers various AI strategies designed to play the popular 2048 tile-merging game. It takes the current game board as input and determines the optimal next move. This tool is for game enthusiasts, AI researchers, or competitive players interested in understanding and applying advanced game-playing algorithms.
game-AI
2048-strategy
expectimax
temporal-difference-learning
game-simulation
About 2048-AI-Solvers
NathanWine/2048-AI-Solvers
Collection of AI algorithms to solve/optimize 2048 games.
Related comparisons
Scores updated daily from GitHub, PyPI, and npm data. How scores work