Minimax McTs
Minimax Monte Carlo Tree Search (MCTS) enhances decision-making in complex scenarios by combining the exploration-exploitation balance of MCTS with the adversarial reasoning of minimax. Current research focuses on improving MCTS efficiency through techniques like contrastive reflection, integrating it with other methods such as reinforcement learning and combinatorial optimization, and applying it to diverse problems including game playing, autonomous driving, and code generation. These advancements demonstrate the power of minimax MCTS for solving challenging sequential decision-making problems across various domains, offering improved performance and explainability compared to traditional approaches.
Papers
November 17, 2024
October 2, 2024
August 10, 2024
July 11, 2024
June 13, 2024
March 25, 2024
March 21, 2024
February 5, 2024
December 26, 2023
December 22, 2023
October 25, 2023
September 15, 2023
June 5, 2023
May 25, 2023
May 3, 2023
March 3, 2023
December 14, 2022