New Algorithm for Sudoku Puzzles, X-Ray Microscopy

A new algorithm, designed by Cornell physicist Veit Elser to do X-ray diffraction microscopy analysis, can also solve unlimited Sudoku puzzles:

The so-called difference-map algorithm, which Elser says could have applications from productivity optimization to nanofabrication, tackles problems for which the solution must meet two independent constraints. In the case of Sudoku, the constraints are simple: Each of nine numbers, considered alone, appears nine times in the grid so that there is only one per row and column. And all nine numbers appear within each of the nine blocks.
In X-ray diffraction microscopy, the constraints are more complex. But the beauty of the algorithm, as Elser demonstrates, is that complexity doesn’t matter. By applying the algorithm to the jumble of raw data from such an experiment, researchers can now reconstruct from it a clear, detailed image.
The result, shown in images published with a recent article in the Proceedings of the National Academy of Sciences (PNAS) with lead author David Shapiro of the State University of New York at Stony Brook and other colleagues, is a richly detailed image of a specimen as small as a single yeast cell — taken without staining, sectioning or otherwise damaging the specimen.
Unlike optical microscopes, which use a lens to focus light on a target (and are therefore only useful for specimens larger than the wavelength of visible light), imaging methods based on X-rays and electrons take advantage of the finer wavelengths provided by these forms of illumination.
But some of these methods can damage the specimen with harmful radiation, require that a specimen be stained or otherwise altered or lack the penetrating power necessary for three-dimensional reconstructions. X-ray diffraction microscopy, which uses “soft” X-rays and measures the resulting diffraction pattern, is often the method of choice because it gives a detail-rich image and leaves the specimen relatively unscathed.
The tricky part comes in using the diffraction pattern to reconstruct an image of the specimen. Instead of directly measuring the pixel-by-pixel contrast within the specimen, researchers are left with data that represents the object broken down into its constituent waves: a vast number of them, of different frequencies and amplitudes, waiting to be added up in a process called a Fourier synthesis to reconstruct the image.
“But if it were just combining waves with a definite oscillation and adding them up, that would be a piece of cake for a computer to do,” says Elser.
The challenge is in the waves’ phases, which are critical in reconstructing an image from the diffraction data. Without attention to that piece of the puzzle, the resulting image is reduced to noise.
“People used to say that’s an impossible problem,” Elser says. “Then people got to thinking about the fact that there are going to be constraints coming from some rather mundane facts — that in principle will make the problem of deducing the phase like the solution of a solvable puzzle.”
The mundane fact, in this case, was a basic premise of the X-ray diffraction experiment: that the object in view have a clearly defined boundary (i.e., that all pixel values outside that boundary be set to zero).
“If I set up waves with known amplitudes and synthesize them, I’ll find that for essentially all random combinations of phases, the thing I get is an object not confined,” Elser says. “It takes a very clever combination of the phases of all those waves to add up to something in only one region; and cancel out everywhere else.”
For the second constraint, the researchers required that the wave amplitudes used in the Fourier synthesis matched those measured by the experiment.
With the two constraints in place, the difference-map algorithm completes the job.

Go ahead and click on the link below to try to solve the puzzle: Cornell is to publish the solution later this month
More from the Cornell News Service…