Questions tagged [monte-carlo-tree-search]

This tag should be used for questions about the MCTS algorithm (how/why it works, potential applications, enhancements, combinations with other algorithms, implementation, etc.)

11 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
4
votes
2answers
73 views

MCTS for non-deterministic games with very high branching factor for chance nodes

I'm trying to use a Monte Carlo Tree Search for a non-determinstic game. Apparently one of the standard approaches is to model non-determinism using chance nodes. The problem for this game is that it ...
4
votes
2answers
184 views

Determinization step in Information Set Monte Carlo Tree Search

After reading this paper about Monte Carlo methods for imperfect information games with elements of uncertainty, I couldn't understand the application of determinization step in author's ...
3
votes
0answers
43 views

Feature Selection using Monte Carlo Tree Search

I'm trying to tackle the problem of feature selection as an RL problem, inspired by the paper Feature Selection as a One-Player Game. I know Monte-Carlo tree search (MCTS) is hardly RL. So, I used ...
2
votes
0answers
52 views

What is the time complexity of an unparellelized Monte Carlo tree search?

I am writing a report where I used a slightly modified version of MCTS (not parallelized). I thought It could be interesting if I could calculate its time complexity. I'd appreciate any help I could ...
2
votes
0answers
10 views

How is GARB implemented in PGRD-DL to calculate gradients w.r.t. internal rewards?

In section 3 of this paper the author outlines how GARB was adapted to reduce the variance in updating parameters to an internal reward function estimator. I have read it a number of times and ...
2
votes
0answers
65 views

Understanding an execution of the Monte Carlo tree search algorithm

I have these Monte Carlo Tree Search, and I need to expand it, but I don't understand the step 1 and 2, why it it goes to the first Node and then make a new Node? instead of go to the depthest left ...
1
vote
0answers
44 views

How is q-learning related to game trees?

At a first look, q-learning is a revolutionary strategy in realizing Artificial Intelligence. It has to do with finding a policy, a reward structure, neural networks for storing the q-table and a ...
1
vote
2answers
254 views

Is Monte Carlo Tree Search appropriate for problems with large state and action spaces?

I'm doing a research on a finite-horizon Markov decision process with $t=1, \dots, 40$ periods. In every time step $t$, the (only) agent has to chose an action $a(t) \in A(t)$, while the agent is in ...
0
votes
0answers
18 views

Tweaking MCTS to account for opponent knowing the state of the game

I'm making an artificial intelligence for a card game using MCTS. With a standard 52-cards deck, 4 hands are dealt: 1 for each of the 3 players and one extra hand. Then, each player gets the choice to ...
0
votes
0answers
34 views

Proof of Correctness of Monte Carlo Tree Search

I'm trying to make the proof of correctness of Monte Carlo Tree Search. Any help would be really appreciated.
-4
votes
1answer
153 views

Are recent advances in machine learning really “artificial” intelligence, or merely brute force and human design?

It sounds like people boast of something being "artificial" about machine learning when actually people boast that humans implemented algorithms like e.g. Monte Carlo Search (MCST) etc. I think the ...