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

Table of Contents

• About the Project
  • Built With
• Getting Started
  • Prerequisites
  • Installation
• Usage
• Roadmap
• Contributing
• License
• Contact

About The Project

JGraphs is a toolset to work with MCTS-based algorithms. JGraphs is an extensible framework that allows developers to create applications based on MCTS in an agile and simple way. It provides several utilities that facilitate analysis, debugging, visualization and interoperability between applications, while offering some default implementations as well as extension mechanisms to make it easier for developers to tailor the code to their specific needs. With JGraph, developers will be able to focus on solving MCTS-based problems, which are already very complex, rather than reinventing the wheel repeatedly

Built With

• Apache Commons
• Google Guice
• Graphviz-java
• H2 Database Engine
• JSON-java
• JUnit
• SLF4J
• SPF4J
• zjsonpatch

Getting Started

To get a local copy up and running follow these simple example steps.

Prerequisites

• Java 10
• Maven

Installation

1. Clone the repo

git clone https://github.com/vicegd/jgraphs.git

2. Compile the code

mvn compile  

3. Execute the code

mvn exec:java -Dexec.mainClass="YOUR_EXTENSION"

Usage

Exaples and ways to work with JGraphs will be placed on the Wiki

Roadmap

See the open issues for a list of proposed features (and known issues).

Contributing

Any contributions you make are greatly appreciated.

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

License

Distributed under the GNU GPLv3 License. See LICENSE for more information.

Contact

Vicente García Díaz - https://www.vicen.info/

Project Link: https://github.com/vicegd/jgraphs/