AIBullisharXiv – CS AI · May 297/10
🧠Researchers introduce PokerSkill, a framework that enables large language models to play expert-level poker without training or computational solvers by combining rule-based poker skills with LLM reasoning. The approach achieves competitive performance against state-of-the-art GTO benchmarks, reducing losses by 49-61% compared to standard LLM prompting and outperforming established poker bots.
🧠 GPT-5🧠 Claude🧠 Opus
AIBullisharXiv – CS AI · Mar 57/10
🧠Researchers developed AutoHarness, a technique where smaller LLMs like Gemini-2.5-Flash can automatically generate code harnesses to prevent illegal moves in games, outperforming larger models like Gemini-2.5-Pro and GPT-5.2-High. The method eliminates 78% of failures attributed to illegal moves in chess competitions and demonstrates superior performance across 145 different games.
🧠 Gemini
AINeutralarXiv – CS AI · May 296/10
🧠Researchers develop a self-play reinforcement learning framework for Big 2, a four-player imperfect-information card game, demonstrating that PPO outperforms value-based methods under controlled conditions. The study reveals that entropy regularization and current-policy self-play improve agent performance, establishing Big 2 as a useful benchmark for testing deep RL in complex multi-agent environments with hidden information and variable action spaces.
AINeutralarXiv – CS AI · May 275/10
🧠Researchers propose Monte Carlo Permutation Search (MCPS), an improved Monte Carlo Tree Search algorithm that enhances the GRAVE algorithm for game-playing AI. MCPS leverages statistics from all playouts containing moves along the path from root to node, demonstrating superior performance across multiple games while eliminating GRAVE's bias hyperparameter.
AINeutralarXiv – CS AI · May 46/10
🧠Researchers have developed Solly, an AI agent that achieved elite human-level performance in Liar's Poker through self-play reinforcement learning, winning over 50% of hands against top players. This breakthrough extends AI capabilities beyond two-player games to complex multi-player scenarios with imperfect information, demonstrating novel strategic behaviors that resist exploitation by world-class competitors.
AIBullisharXiv – CS AI · Mar 126/10
🧠Researchers developed a lightweight AI framework for the Game of the Amazons that combines graph attention networks with large language models, achieving 15-56% improvement in decision accuracy while using minimal computational resources. The hybrid approach demonstrates weak-to-strong generalization by leveraging GPT-4o-mini for synthetic training data and graph-based learning for structural reasoning.
🧠 GPT-4
AINeutralMIT Technology Review · Feb 275/104
🧠The article discusses how AlphaGo's victory over Lee Sedol ten years ago has fundamentally changed how top Go players approach the game. AI has rewired the strategic thinking of the world's best Go players, representing a significant shift in the ancient game's evolution.
AINeutralarXiv – CS AI · Mar 174/10
🧠Researchers developed an evolutionary transfer learning approach to adapt chess AI heuristics for Dragonchess, a 3D chess variant. While direct transfers from Stockfish failed, evolutionary optimization using CMA-ES significantly improved AI performance in this complex multi-layer game environment.
AINeutralarXiv – CS AI · Feb 274/108
🧠Researchers introduce GRAVE2, GRAVER and GRAVER2 algorithms that extend Generalized Rapid Action Value Estimation (GRAVE) for game playing AI. These new variants dramatically reduce memory requirements while maintaining the same playing strength as the original GRAVE algorithm.
