This week I tackled the second assignment, which proved more difficult - but hence more rewarding - than the first by a not-insignificant margin. Classes are slowly becoming more natural to me, though I'm still bothered by large portions of seemingly redundant code as a result of inheritance. Alas, I'm able to appreciate the structure much more now that we've added more subclasses to assignment one. The implementation of Tippy was rather straightforward, but minimax was quite challenging and, many logic errors and print statements later, was a very rewarding algorithm to finally implement correctly.
As for the course material, I find it very straightforward and frankly a tad slow paced for the moment - something I imagine I can credit at least partially to my grade 12 CS teacher. Trees I find especially interesting because of the various possibilities they provide via recursion.
