Today, Sam and I worked on 2014 UMD contest problem number 4, which is called Minion Walk. It involves checking if there is a path from the top left of a grid of squares to the bottom right using a flood algorithm. The algorithm checks if the space it is currently in is empty, then makes a recursive call to each adjacent space, eventually traversing all possible spaces. It was actually pretty easy for Sam and I, since Sam already had experience with this sort of algorithm.
Kevin also emailed me and asked me to look into the Open Closed Principle of object oriented programming, which I didn't get a chance to do today. I'll be sure to look into that tomorrow.
Sam has been doing a bit of thinking about contest preparation strategy, and I wrote him saying I'm glad to see him taking the initiative on that. We need to get the whole team working together to make preparation most effective.
ReplyDelete