Today has been productive.
Got my coursework, which became more interesting when it was explained that we aren't allowed to use any of the Java built-in list classes.
Started my coursework.
Signed for a house that's within 15 minutes of campus (ha at you, Leamington Spa), with Louise and two people I've met twice.
Discovered that the A* search algorithm is basically Dijkstra's algorithm, only the "value" of a node is equal to the cost of getting there plus the estimated cost of getting to the target, instead of just the cost of getting there.
Counting all times past midnight as part of today, I had an excellent discussion with Hennell.
And perhaps most importantly, I demonstrated to someone that their tin opener will actually work, so long as you use it the right way.