policy
Monte-Carlo-Tree-Search-Agent-for-the-Game-of-HEX
Elilgo324 · PyTorch
or hover any field below to flag it
Overview
Name
Monte-Carlo-Tree-Search-Agent-for-the-Game-of-HEX
Author
Elilgo324
Framework
PyTorch
License
unknown
Skill type
manipulation
Evidence level
untested
Task description
MONTE Carlo Tree Search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space and building a search tree according to the results. It has already had a profound impact on Artificial Intelligence (AI) approaches for domains that can be repre
Spaces
Action space
other · 0-dim · 0Hz
Observation space
- type: other
Links
HuggingFace repo
null
Paper (arXiv)
null
Compatible robots
20anybotics-anymal-cnot in seedalohanot in seedgoogle-barkour-vbnot in seedboston-dynamics-spotnot in seedfranka-fr3not in seedgoogle-barkour-v0not in seedagilex-pipernot in seedberkeley-humanoidnot in seedbitcraze-crazyflie-2not in seedanybotics-anymal-bnot in seedagility-cassienot in seedarx-l5not in seedbooster-t1not in seedfranka-emika-pandanot in seedfranka-fr3-v2not in seeddynamixel-2rnot in seedflexiv-rizon4not in seedassetsnot in seedapptronik-apollonot in seedfourier-n1not in seed
Compatible environments
0No environments list Monte-Carlo-Tree-Search-Agent-for-the-Game-of-HEX yet.
Datasets that reference this policy
0No datasets reference Monte-Carlo-Tree-Search-Agent-for-the-Game-of-HEX yet.