Split Moves for Monte-Carlo Tree Search | Zendy

Jakub Kowalski | Zendy; Maksymilian Mika | Zendy; Wojciech Pawlik | Zendy; Jakub Sutowicz | Zendy; Marek Szykuła | Zendy; Mark H. M. Winands | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Split Moves for Monte-Carlo Tree Search

Author(s) -

Jakub Kowalski,

Maksymilian Mika,

Wojciech Pawlik,

Jakub Sutowicz,

Marek Szykuła,

Mark H. M. Winands

Publication year - 2022

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v36i9.21265

Subject(s) - monte carlo tree search , computer science , heuristics , granularity , tree (set theory) , formalism (music) , theoretical computer science , combinatorial game theory , generalization , set (abstract data type) , monte carlo method , sequence (biology) , action (physics) , algorithm , mathematical optimization , game theory , sequential game , mathematics , mathematical economics , art , mathematical analysis , musical , statistics , programming language , physics , quantum mechanics , biology , visual arts , genetics , operating system

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