June 11th, 2010
The newly restored complete version of Metropolis opens tonight the Senator Theater for a one-week run. If you like movies about robots, or dystopian futures or just like classic fims that made a difference, it is well worth seeing.
Baltimore is lucky to be one of about ten cities in the US screening it this summer and the only one on the east coast outside of Boston. From the Baltimore Sun
“This “complete” version of Lang’s silent sci-fi extravaganza restores all of its subplots and nearly all of its surging imagery. With Gottfried Huppertz’s soaring romantic score heard in full for the first time, “Metropolis” offers an engulfing audiovisual experience. It leaves you shaking your head in wonder and disbelief.
Those new to the film can sit back and be overwhelmed. Those who’ve seen it have the additional pleasure of watching a puzzle solved before your eyes. Roughly 25 minutes longer than the 2002 version, this print of “Metropolis” uses footage from a 16-millimeter dupe negative found in Buenos Aires to fill in some major bits and pieces — and some minor ones.
You can tell the 16-mm footage from the drop in picture quality. But the effect is thrilling, not jarring. This print combines the ecstasy of seeing a peak accomplishment in pristine form with the frisson movie-lovers get from viewing films as artifacts of their time, aging the way gardens or buildings do.”
March 29th, 2008
Tomas Rokicki has written up a proof that any Rubik’s Cube configuration can be solved in 25 or fewer moves. In his paper, Twenty-Five Moves Suffice for Rubik’s Cube, Rokicki proves that there are no configurations that can be solved in exactly 26 moves. Taken with earlier results, this means that 25 movies should suffice for any solution.
“How many moves does it take to solve Rubik’s Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or more moves; this is a surprisingly large gap. This paper describes a program that is able to find solutions of length 20 or less at a rate of more than 16 million positions a second. We use this program, along with some new ideas and incremental improvements in other techniques, to show that there is no position that requires 26 moves.”
KFC writes on the the physics arXiv blog that
“Rokicki’s proof is a neat piece of computer science. Heâ€™s used the symmetry of the cube to study transformations of the cube in sets, rather than as individual moves. This allows him to separate the â€œcube spaceâ€ into 2 billion sets each containing 20 billion elements. He then shows that a large number of these sets are essentially equivalent to other sets and so can be ignored. Even then, to crunch through the remaining sets, he needed a workstation with 8GB of memory and around 1500 hours of time on a Q6600 CPU running at 1.6GHz.”
Rokicki is working to establish a bound of 24 moves and thinks that a bound of 20 can eventually be proved.