Revisit

After looking back to all the slogs that I had written, I have to say that i have change my mind about writing slog. I used to think it is useless. The only reason I write it is that TA marks it seriously. However, I see some progress on it. I look back to my first slog, why geek needs to write. I am admitted that it is a very bad slog with no critical thinking and no point.  It only gets 33%. After the first slog, I tried my best to write the slog on time and tried to think more when I wrote it. So, in the blog, summary of recursion, I saw myself having some thinking in it. In that blog, I talked about how I figure out the program. I talked about finding the basic case and finding how the program recurs. That means that I really tried to write the slog better.

Secondly, I also looked at others blog. Some of them stop updating their blog. I guess they may drop the course because some of my friends drop it since they were not doing well in the midterm and assignment. However, there are still some good slogs that are keeping updating their blog. For example, I have visited the blog (http://csc148slog1001429162.blogspot.ca). To be honest, his slog is way better than mine. In his second last blog, he talks about Binary Search Trees and some methods about it. His idea about how the delete method works helps me to understand it. And his blog about recursion is also talking about the best way to make recursion easier to think, which is writing the basic case firstly. I can tell that the owner of this blog is doing very well on csc148 because he has his own thinking on some key knowledge such as recursion and ADT. He also talks about that Computer science is much more than coding. I agree with that. Sometime when I feel hard to write the code, I just have no idea of the logical thinking. After I know the logic and how the program works, it is very easy to write the code quickly and correctly. 

In conclusion, writing slog is not only helping me to collating my knowledge about csc148, but also forces me to think more and creative.

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.