2 of 2

Step 2: Expansion�

Implement the Expansion step of the MCTS algorithm

How should the adding of new nodes work?

How should this step connect to the previous one?

Pick actions starting from the last one. (This doesn’t have anything to do with MCTS in general, it’s just the way I did it and it’s important for our implementations to be as similar as possible.)

Write your implementation so that it compiles.

Send your solutions to me (via Discord or mail).

Deadline: 16.12.2024 23:59 (the evening before the next lecture)

1 of 2

2 of 2