chrominoes


chrominoes, a MATLAB code which searches for tilings of a polygonal region using polyominoes, in which a coloring scheme is used to reduce the problem size and quickly eliminate certain arrangements.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

chrominoes is available in a MATLAB version.

Related Programs and Data:

chrominoes_test

cplex_solution_read, a MATLAB code which extracts solution data from a CPLEX solution file; CPLEX reads an LP problem definition file, which might have been created by polyomino_monohedral_matrix() or polyomino_multihedral_matrix(), and returns a solution file. This function opens the solution file and extracts the solution information in a standard vector format.

pariomino, a MATLAB code which considers pariominoes, which are polyominoes with a checkerboard parity.

polyomino_parity, a MATLAB code which uses parity considerations to determine whether a given set of polyominoes can tile a specified region.

polyominoes, a MATLAB code which defines, solves, and plots a variety of polyomino tiling problems, which are solved by a direct algebraic approach involving the reduced row echelon form (RREF) of a specific matrix, instead of the more typical brute-force or backtracking methods.

Reference:

  1. Marcus Garvie, John Burkardt,
    A new mathematical model for tiling finite regions of the plane with polyominoes,
    Contributions to Discrete Mathematics,
    Volume 15, Number 2, July 2020.
  2. Marcus Garvie, John Burkardt,
    A new algorithm based on colouring arguments for identifying impossible polyomino tiling problems,
    Algorithms,
    Volume 15, Number 2, 65, February 2022.
  3. Solomon Golomb,
    Polyominoes: Puzzles, Patterns, Problems, and Packings,
    Revised and expanded second edition,
    Princeton University Press, 1996,
    ISBN: 9780691024448

Source Code:


Last revised on 16 February 2023.