JGraphs: A Toolset to Work with Monte-Carlo Tree Search-Based Algorithms

Abstract

Monte-Carlo methods are the basis for solving many computational problems using repeated random sampling in scenarios that may have a deterministic but very complex solution from a computational point of view. In recent years, researchers are using the same idea to solve many problems through the so-called Monte-Carlo Tree Search family of algorithms, which provide the possibility of storing and reusing previously calculated results to improve precision in the calculation of future outcomes. However, developers and researchers working in this area tend to have to carry out software developments from scratch to use their designs or improve designs previously created by other researchers. This makes it difficult to see improvements in current algorithms as it takes a lot of hard work. This work presents JGraphs, a toolset implemented in the Java programming language that will allow researchers to avoid having to reinvent the wheel when working with Monte-Carlo Tree Search. In addition, it will allow testing experiments carried out by others in a simple way, reusing previous knowledge.