Seek Solutions of Polyomino Monohedral Tiling
a MATLAB library which
is given matrices defining a region R and a polyomino P; it sets up
the corresponding linear system, and solves for
binary solutions x that represent possible tilings of the region R by
the polyomino P.
A region R is a subset of an MRxNR grid of squares.
A polyomino P is a subset of an MPxNP grid of squares.
Both objects are represented by binary matrices, with the property that
there are no initial or final zero rows or columns.
The computer code and data files described and made available on this web page
are distributed under
the GNU LGPL license.
polyomino_monohedral is available in
a MATLAB version.
Related Data and Programs:
is TRUE if an I4MAT contains only 0 and 1 entries.
returns, one at a time, all the K-subsets of a set.
cleans up a matrix that represents a polyomino by setting all nonzero
entries to 1, and removing initial and final rows and columns of zeros.
for each possible embedding, lists the translation necessary to
to apply to the polyomino.
reports the number of ways a polyomino can be embedded in a region.
is true if two polyominoes are equal.
computes an index for each nonzero polyomino entry.
writes an LP file describing a particular problem.
sets up and solves a polyomino monohedral tiling problem.
determines the matrix and right hand side for a polyomino monohedral
prints a tiling of a region R by a polyomino P, based on a solution
computed by polyomino_monohedral.
carries out reflections and rotations of a polyomino to
determine which transformations yield distinct variants.
prints a polyomino.
carries out reflections and rotations of a polyomino.
returns the reduced row echelon form of an R8MAT.
seeks binary solutions (if any) of a row reduced echelon form
linear system in which exactly NZ entries are nonzero.
solves an upper triangular linear system.
returns a row of the identity matrix as an R8VEC.
is true if all entries of an R8VEC are 0 or 1.
prints the YMDHMS date as a timestamp.
Last revised on 27 February 2019.