No confident code implementation found for this paper. 5 possible matches can be shown below.
Monte Carlo Tree Search can be used for automated theorem proving. Holophrasm is a neural theorem prover using MCTS combined with neural networks for the policy and the evaluation. In this paper we propose to improve the performance of the Holophrasm theorem prover using other game tree search algorithms.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Beyond Games: A Systematic Review of Neural Monte Carlo Tree Search Applications
TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs
Imitation Learning for Connection-Tableau Construction
Proof Number Based Monte-Carlo Tree Search
Learning to Play 7 Wonders Duel Without Human Supervision
Summarizing Strategy Card Game AI Competition
@article{pierre2023mathematical,
title = {The Mathematical Game},
author = {Marc Pierre and Quentin Cohen-Solal and Tristan Cazenave},
year = {2023},
eprint = {2309.12711},
archivePrefix = {arXiv},
url = {http://arxiv.org/abs/2309.12711v1}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2309.12711)