I have the following problem called "1-2 steal marbles".
Initially, there are 6 marbles on the board. One of the players can choose to remove 1 or 2 marbles leaving 5 or 4. After that, the other player can do the same, choosing to take again 1 or 2 marbles from the board. The process continues until there is only one marble on the board. The player who wins is the one the leaves the last marble on the board. (For example: If there are 3 marbles and it's my turn, then I will choose to remove 2 to leave one in the board to win)
How can I draw the search tree that represents the application of the alpha-beta pruning to this "1-2 steal marbles" with 13 marbles? I would like to see the maximizer and minimizer nodes and the value at the nodes too.