Tiling puzzles - Polyforms, Tetromino, Soma cube, Pentomino, Dominoes, Polyomino, Tangram, Jigsaw puzzle, Packing problem, Ostomachion, Tantrix, Jigsaw puzzle accessories, Eternity II puzzle, Domino tiling, Mutilated che
| Verlag | Books LLC |
| Auflage | 2012 |
| Seiten | 92 |
| Format | 18,9 x 24,6 x 0,2 cm |
| Paperback | |
| Gewicht | 194 g |
| Artikeltyp | Englisches Buch |
| EAN | 9781156638682 |
| Bestell-Nr | 15663868UA |
Source: Wikipedia. Pages: 43. Chapters: Polyforms, Tetromino, Soma cube, Pentomino, Dominoes, Polyomino, Tangram, Jigsaw puzzle, Packing problem, Ostomachion, Tantrix, Jigsaw puzzle accessories, Eternity II puzzle, Domino tiling, Mutilated chessboard problem, Polyiamond, Hexomino, Eternity puzzle, Octomino, Heptomino, Nonomino, Connect, Puzz-3D, Polyabolo, Polyominoid, Polycube, Slothouber Graatsma puzzle, Bedlam cube, Three-dimensional edge-matching puzzle, Polyhex, Tiling puzzle, Puzzle globe, Conway puzzle, Polystick, Polydrafter, T puzzle. Excerpt: A polyomino is a plane geometric figure formed by joining one or more equal squares edge to edge. It is a polyform whose cells are squares. It may be regarded as a finite subset of the regular square tiling with a connected interior. Polyominoes are classified according to how many cells they have: Polyominoes have been used in popular puzzles since at least 1907, and the enumeration of pentominoes is dated to antiquity. Many result s with the pieces of 1 to 6 squares were first published in Fairy Chess Review between the years 1937 to 1957, under the name of dissection problems. The name polyomino was invented by Solomon W. Golomb in 1953 and it was popularized by Martin Gardner. Related to polyominoes are polyiamonds, formed from equilateral triangles; polyhexes, formed from regular hexagons; and other plane polyforms. Polyominoes have been generalised to higher dimensions by joining cubes to form polycubes, or hypercubes to form polyhypercubes. Like many puzzles in recreational mathematics, polyominoes raise many combinatorial problems. The most basic is enumerating polyominoes of a given size. No formula has been found except for special classes of polyominoes. A number of estimates are known, and there are algorithms for calculating them. Polyominoes with holes are inconvenient for some purposes, such as tiling problems. In some contexts polyominoes with holes are excluded, allowing only simply connected polyominoes. There are three common ways of distinguishing polyominoes for enumeration: The following table shows the numbers of polyominoes of various types with n cells. Let denote the number of fixed polyominoes with n cells (possibly with holes). As of 2004, Iwan Jensen has enumerated the fixed polyominoes up to n=56: is approximately 6.915×10. Free polyominoes have been enumerated up to n=28 by Tomás Oliveira e Silva. The dihedral group is the group of symmetries (symmetry group) of a square. This group contains four rotations and four reflections. It is