arXiv:2404.16072
공식 코드 · Papers with Code
Playing Board Games with the Predict Results of Beam Search Algorithm
원문 초록
This paper introduces a novel algorithm for two-player deterministic games with perfect information, which we call PROBS (Predict Results of Beam Search). Unlike existing methods that predominantly rely on Monte Carlo Tree Search (MCTS) for decision processes, our approach leverages a simpler beam search algorithm. We evaluate the performance of our algorithm across a selection of board games, where it consistently demonstrates an increased winning ratio against baseline opponents. A key result of this study is that the PROBS algorithm operates effectively, even when the beam search size is considerably smaller than the average number of turns in the game.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Vision Language Models are Biased
4Hammer: a board-game reinforcement learning environment for the hour long time frame
Playing Non-Embedded Card-Based Games with Reinforcement Learning
ZeroSumEval: An Extensible Framework For Scaling LLM Evaluation with Inter-Model Competition
Playing Hex and Counter Wargames using Reinforcement Learning and Recurrent Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.