Step 1:

In practice section modify the tree, terminal values and the starting player

Step 2:

Start the minimax algorithm and select the correct node when it stops and asks for selecting node. Then proceed ahead by clicking next.

Step 3:

If you pick the wrong node when asked then you will be given hints in the observations. Also you will be given hints and information as you proceed with the algorithm. You have to basically understand if its maximizer's or minimizer's turn and the pick the corect move (node) accordingly

Step 4:

Finally you will reach the end where the final path will be highlighted in green displaying the optimal move in each chance. You can start again with different parameters.