Publication:4313096
From MaRDI portal
zbMath0831.05020MaRDI QIDQ4313096
Publication date: 10 November 1994
puzzles; packings; enumeration; squares; problems; polyominoes; patterns; recreational mathematics; checkerboard; tiling rectangles
05B45: Combinatorial aspects of tessellation and tiling problems
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05B50: Polyominoes
00A08: Recreational mathematics
Related Items
Unnamed Item, Unnamed Item, Geometrical Regular Languages and Linear Diophantine Equations, An algorithm for deciding if a polyomino tiles the plane, Polyomino convolutions and tiling problems, Comparison of algorithms for reconstructing \(hv\)-convex discrete sets, Helly numbers of polyominoes, Packing polyominoes clumsily, Exhaustive generation of gominoes, Combinatorial properties of double square tiles, Many L-shaped polyominoes have odd rectangular packings, Geometrical regular languages and linear Diophantine equations: the strongly connected case, Minimal non-convex words, Self-affine convex polygons, On the tiling system recognizability of various classes of convex polyominoes, Mirror-curves and knot mosaics, On the table and the chair, Families of irreptiles, A generalization of the pentomino exclusion problem: dislocation of graphs, On the tiling by translation problem, Tetris and decidability, Gray codes for column-convex polyominoes and a new class of distributive lattices, Enumeration of symmetry classes of convex polyominoes in the square lattice, Tiling rectangles and half strips with congruent polyominoes, The site-perimeter of bargraphs, Solomon Golomb -- some personal reflections plus random biographical and bibliographical notes, A short scientific biography of Maurice Nivat, A bijection for the total area of parallelogram polyominoes, Combinatorial aspects of \(L\)-convex polyominoes, Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity, A method to generate polyominoes and polyiamonds for tilings with rotational symmetry, On the complexity of Jensen's algorithm for counting fixed polyominoes, The number of Z-convex polyominoes, Hinged dissection of polyominoes and polyforms, The discrete Green theorem and some applications in discrete geometry, Regular Geometrical Languages and Tiling the Plane, Tiling a Manhattan Polyomino with Bars, Perfect Matchings of the Small Polyominoes
