GitHub / darian-catalin-cucer / monte-carlo-tree-search

A decision-making algorithm used for game playing and decision-making problems. This algorithm combines the power of Monte Carlo simulation with the depth of tree search to find the best move or action. This GitHub project implements MCTS in Kotlin to solve decision-making problems efficiently.

JSON API: https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darian-catalin-cucer%2Fmonte-carlo-tree-search

Commit Stats

Commits: 2
Authors: 1
Mean commits per author: 2.0
Development Distribution Score: 0.0
More commit stats: https://commits.ecosyste.ms/hosts/GitHub/repositories/darian-catalin-cucer/monte-carlo-tree-search

Topics: algorithms, android, artificial-intelligence, board-games, decision-making, decision-trees, game, game-theory, heuristic-algorithm, kotlin, machine-learning, monte-carlo, optiimzation, path-finding, probability, random, reinforcement-learning, search-algorithm, tree-search

Files

No dependencies found