Deutsche Version
## Herbert Kociemba's Homepage |

## Content |

Restoring a Rubik's cube is not the easiest task but if you want to do this in 20 moves or less the bar has been raised even higher. Cube Explorer implements an algorithm which is capable of doing this and it finds the solution usually within fractions of a second. |

The 15-Puzzle is a sliding puzzle that triggered a similar hype in 1880 as Rubik's cube did exactly 100 years later. The Fifteen Puzzle Optimal Solver solves any given position in the minimal number of moves. Though the complexity of this puzzle is lower than that of Rubik's Cube, the task of finding an optimal solution for this puzzle is not always easy. If you find a solver or you have written a solver which runs considerably faster than the one provided here please let me know. |

The Pentarot 2D Rotational puzzle was inspired by my interest in Penrose tilings. It has 36 pentagonal tiles which are scrambled by rotating the 5 rings with 10 pentagons each. Sadly I did not find a way to realize it physically, but you can downlad a Windows program to play with it. |

A Penrose tiling consists of a set of tiles which tesselate the plane with no overlaps and no gaps. The tiling was invented 1973 by Roger Penrose. That Penrose tilings and the centuries-old tradition of islamic ornamental designs with five- and tenfold symmetric elements have similarities was noticed by Peter Lu from Harvard University in 2007 and provoked major media interest. It is not clear yet, however, to what extent the ancient architects were aware of the underlying mathematical laws of a Penrose tiling. More recent works by Peter R. Cromwell 2015 and 2016 tend to give a negative answer to this question. Reflections on these tilings result in a set of tiles in the style of Islamic art which forces a tiling equivalent to a Penrose tiling (or in the exact mathematical terminology: the tilings are mutually locally derivable). |

The NxM-Sudoku is a generalization of the standard 3x3 Sudoku with 9 squares of size 3x3 and a total of 81 cells. In the general case we have N*M rectangles of size NxM and a total of (N*M) Though there are standard Sudokus which are almost impossible to solve only with logical reasoning by humans, from a computational point of view solving a standard Sudoku is almost trivial. Since the general problem is NP-complete finding a solution gets more demanding for larger grids. We choose an approach where we simplify the given NxM-Sudoku as far as possible using "human" methods like hidden and naked singles and tuples, block-line interaction etc. and transform the remaining problem into a boolean satisfiability problem. We then use Sat4J for solving. |

The 125puzzle is a quite difficult puzzle where you have to place 25 Y-pentacubes in a 5x5x5 box. I never managed to solve the puzzle manually. But I successfully could solve the puzzle using a SAT-solver and present 5 solutions with a special property. As a byproduct I also give solutions for 20 Y-pentacubes in a 5x5x4 box, for 16 Y-pentacubes in a 4x4x5 box, for 12 Y-pentacubes in a 4x5x3 box and for 12 Y-pentacubes in 5x6x2 box. |

The Spiral of Theodorus, eventually vaguely familiar from school mathematics provides certainly the opportunity for investigations which goes beyond the subject matter at school. On this page wie find with the help of the Euler–Maclaurin formula arbitrary good approximations for the discrete and analytic version of the square root spiral. We compute the so called Schneckenkonstante K to more than 500 decimal places and visualize the used methods in this Geogebra-Applet. |

©
2020 |