The Null Device


Computer scientists at MIT prove that Tetris is NP-hard; i.e., optimally stacking blocks is in the same class of problems as things like the Travelling Salesman problem, meaning that there is no known way to solve them efficiently. Maybe this means that we'll soon see Tetris-based cryptographic algorithms?

algorithms computer science np- tetris videogames 0

I picked up the recent Time Out (sort of like the London Beat/InPress, only in magazine format, not free and a bit more upmarket), and apparently there's an indie-band open-stage night tonight at some place called the George and Dragon, in West Acton. Which could be something good, or it could be third-rate post-Oasis brit-rock bands or something. I might go to check it out anyway.

Also, the supports for next Tuesday's Ninetynine gig at the Metro Club sound good; one of them is said to be C86 inspired, which to a Field Mice fan like myself sounds rather promising.

In other words, I went to the Portobello Market today and scored a pair of Doc Martens for £35 (which comes out as A$98 or so with the peso's current exchange rate). Not bad, given that they cost close to twice that much back home. Ben Sherman shirts don't seem to be much cheaper here, though.

london personal 3