"...why didn't I know how to make these when I was taking Data Management in high school and had to calculate the probability of a certain outcome?!"Genuinely an exact quote from my last post - and now here we are implementing Minimax for Assignment 2. Me and my group have been at this for hours and we've gone through at least three different full concepts of how to implement this strategy with trees. I'm beginning to feel like I don't understand trees fully... or maybe I'm just getting really frustrated by Minimax. Although I am really frustrated, I really feel my problem solving biceps growing and my logical muscles stretching. We've eliminated some possibilities of how not to do this assignment, so surely we're closer to figuring out how to do this assignment?! I have faith in myself and my group that we'll finish it on time (check out my group member's posts on their perspectives on working on this assignment), and if anything we'll have bonded over conflicting ideas, arguments, and sheets of pseudo-code surrounding us on all sides.
In other, less stress-inducing news, we're learning about linked lists in class! My excitement arises from the fact that I have previously studied and implemented linked lists in high school, although slightly differently in Java. I feel like I thoroughly understood how linked lists worked and how to manipulate them previously, so hopefully it won't be so bad this time around. Looking forward to implementing some cool functions with Linked Lists and expanding my knowledge on this ADT!
No comments:
Post a Comment