ALPHA-BETA PRUNING AND LINEAR REGRESSION PROBLEM
1) Use the alpha-beta pruning for the “1-2 steal marbles “, for 13 marbles.
Initially, there are 13 marbles on the board.
One of the players can choose to remove 1 or 2 marbles leaving 12 or 11, after that the other player can do the same, choosing to take again one or two marbles from the board. The process continue until there is only one marble in 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)
- Formulate the problem
- Describe the decision tree adding the maximizer and minimizer levels of the tree and assigning values to the objective function.
3 Write the algorithm in pseudocode(adapting it to this problem) or in a high-level language
4 Comment the results.
- Can we use the same algorithm for 10000 marbles?. Explain the pros and cons of using this algorithm
2) given the pairs (time, price) (1,3) ,(2,5), (3,8) use linear regression to find the line ax+b that approximate these values. Use that line to calculate the price when the time is 4.
