At first, I thought Minimax part was going to be easy like Tippy game state but it wasn't. Me and my group members didn't know what we had to do to make strategy Minimax work. As we went to lecture, we heard some hints that we need to use recursion or tree. We planned and worked but it didn't work out and we failed to work it out. At last, we handed it in with failed version. I was depressed about this but it made me determine that I shouldn't be lazy about the assignment like taking a break after one part.
In the week 7 lecture, we mostly focused on our assignments, and we learned about binary tree which has two children in one node. I'm not that good about tree concepts so that is what I have to study for the term test 2 on Wednesday.
댓글 없음:
댓글 쓰기