Slog of ninth week

I  would like to talk about the assignment 3 in this slog.

Our group choose to do the option A.

There are 3 things we need to do about the optionA.

The first things is the minimax_memorize. It needs us to record the game state that the function meet . How i deal with it is to create a dictionary and record the game state in the suggest_move. Also, before apply move, we need to check if our dictionary has that game state. If it has , then the function will return the move recorded in the dictionary.

The second methods is to avoid investigating moves that i know will not change the result. Those moves wastes so much time. I got nothing to say about this methods because we just followed the instruction given by Denny. It is not hard.

The last one is wired. We need to limit the moves that the program will look ahead. So we  need to stop the recursion program when moves it look forward is bigger than n. In our recursion program, when n is bigger than like 10, the recursion program will call the rough_outcome program to estimate the score of the game state.