Can you implement the mini-max until game completion (infinite depth) and simply play to avoid defeat all times? Are there any limitations in doing this? What about for chess? Ans What evaluation function would you use for the board if you were playing chess? Is it as easy to find one as you did for Othello? Ans. Create a small MDP and run the Sarsa algorithm manually, showing what the states, actions, and rewards are at each time step, and what the q-function is at each time step. The MDP should have at least two states and two actions and at least one non-zero reward. You should manually execute two full episodes (so keep the MDP simple!). Be sure to clearly and completely describe the MDP that you have created. Can you implement the mini-max until game completion (infinite depth) and simply play to avoid defeat all times? Are there any limitations in doing this? What about for chess? Ans What evaluation function would you use for the board if you were playing chess? Is it as easy to find one as you did for Othello? Ans. Create a small MDP and run the Sarsa algorithm manually, showing what the states, actions, and rewards are at each time step, and what the q-function is at each time step. The MDP should have at least two states and two actions and at least one non-zero reward. You should manually execute two full episodes (so keep the MDP simple!). Be sure to clearly and completely describe the MDP that you have created