Assignment 2 and TA Strike
Assignment 2 was due last Thursday; it is a challenging
assignment to finish and I spent most of the time on minimax but still
struggled with it a lot.
When I first read the assignment description, I thought of
some ideas to approach the minimax. Though I was not sure if my thinking was absolutely
right, I decided to try it first. My idea was that with current total and next
player given, build a tree with branches of possible routes, then calculate the
possibility of winning of each route and return the route with the greatest
possibility. I started by using the class tree and tried to build a tree of
minimax, but soon I found out it was not an easy job to do and I was stuck on a
function for building a tree of minimax when entering a current game state. I
understood it should be a recursive function, but when I implemented it there
were always errors, so I struggled with it so much. However, when I went to the
office hour, I found out that the way the prof expected was so different than
what I was doing; luckily the way minimx should be implemented was a lot easier
but I got a very limited time to finish it. As I figured out the prof just
expected us to return any one of the moves with the possibility to win, I
rushed to finish it. I keeping working on it until the last couple hours but
still did not have enough time to check all to make it perfect.
Because of the TA strike, this week’s lab was cancelled and I
have to do it on my own. Also, during assignment 2 there was only a very
limited time for office hour and the CS help center was closed. Because of this,
I spent two whole afternoons sitting outside of the prof’s office to ask a
question. The strike is very unbeneficial for students and burdens profs, but at
this stage there is not much we can do about it but hoping it would be over
soon.
No comments:
Post a Comment