Against Stockfish: Game #03: Facing a Double Rook Sacrifice

Using the Monte Carlo Tree Search to hold or beat the unbeatable computer:
Game #03 Analysis:

Lessons from this game:
> Don't let emotions take control (19...Bf6, 21...Re8)
> Study your Openings (6...e6)
> Calculate a bit of everything (12...Nb6)
I might make a study on the openings that I am going to play in this series. And when I do, I'll post it in this blog as an edit.

[edit - 7/15/2024] I created the study today. I will be posting regular opening ideas here:
https://lichess.org/study/Vfydq0l0

Monte Carlo Tree Search

In this series of games, I intend to use a similar method/algorithm to what AlphaZero used to defeat Stockfish 9 in 2017. The structure of the Algorithm is something like this:
> First, we take a list of candidate moves and see which moves are most preferred by our intuition.
> Then we make a play-out (a.k.a roll-out) by applying the same principle from our opponent's side and mark the evaluation when a static position is reached.
> Then we take the average of the so-found leaf positions to assign a value to the calculated candidate move.
> Then we repeat the process for all the candidate moves and compare the move values to come to a final conclusion.
This is how I am going to accomplish my goal. So wish me luck and share your thoughts in the forum. I am always open to feedback and criticism.

External links

YouTube: https://www.youtube.com/@felew699 (No videos yet. I am still working on it)
Against Stockfish: https://lichess.org/study/YTek9jaV
Grammar Editor: https://app.grammarly.com/