Implementation of Monte Carlo Tree Search (MCTS) Algorithm in COMBATXXI using JDAFS | Zendy

Michael P. Teter | Zendy; Arnold H. Buss | Zendy; Christian J. Darken | Zendy; Ricardo Baez | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Implementation of Monte Carlo Tree Search (MCTS) Algorithm in COMBATXXI using JDAFS

Author(s) -

Michael P. Teter,

Arnold H. Buss,

Christian J. Darken,

Ricardo Baez

Publication year - 2014

Language(s) - English

Resource type - Reports

DOI - 10.21236/ada609071

Subject(s) - monte carlo method , monte carlo tree search , computer science , tree (set theory) , algorithm , mathematics , statistics , combinatorics

: The implementation of the Monte Carlo Tree Search (MCTS) algorithm into the Combined Arms Analysis Tool for the 21st Century (COMBATXXI) project is an extension of work completed in FY13. The TRADOC Analysis Center - Methods and Research Office (TRAC-MRO) sponsored this iteration in an attempt to test the feasibility implementing the algorithm into the COMBATXXI simulation environment. For further details on the specific algorithm of more background information see appendix and the previous technical report.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research