Stalkeriffic!

So, there I was in the laundromat a block from enochsmiles' Leuven flat, knitting a sock while the laundry spun around in the washer, when a song with the following lyrics popped on the radio:

You’re the only one I love
And you can’t change that
You’re the only one I need
And you can’t change that

Now you can try if you want to
Woo

You can change your telephone number
And you can change your address too
But you can’t stop me from loving you
No, you can’t change that, no, no

You can change the color of your hair
And you can change the clothes you wear
But you’ll never change the way I care
No, you can’t change that

And all I could think was wow, dude, if she's changing her phone number and her entire wardrobe, maybe she doesn't want you to recognise her or get in touch with her?

Turns out this is actually an old Ray Parker Jr. song; I'm not sure whether it was the original 1979 track or some newer cover (like the Italian cover of "I Can't Help Falling In Love With You" that I also heard), as I'm not especially familiar with the rotation patterns of Belgian pop radio stations.

Attention boardgame junkies

If you or someone you know is an expert at the game Carcassonne, would you care to discuss strategies that you find particularly useful? I played it for the first time last night, and a rousing post-game discussion has me wanting to do a formal analysis of the game's computational complexity and the ways in which game strategy can be optimized, heuristically or otherwise.

Is there a strategy, or set of strategies, which will always win even when other players are using the same strategies? Knowing the shuffled order of the tiles at the start of the game would undoubtedly make strategizing easier (and might reduce the computational complexity of the game as a whole, though I'm not positive about that one), but how would it change your strategy? (Another way of phrasing that last question: is it the same game when you can see the order the tiles will be played in? This may be akin to playing mah-jongg face up.)

Also, game graph theorists (but game theorists too, why not?), can you think of any well-defined problems, regardless of complexity class, which involve multiple non-connected graphs which occupy the same Cartesian space? (My kingdom for a few hours to sit down and chat with Leonhard Euler.)