Tiling with Polynominoes
Let’s consider tiling square grids using polynominoes of any number of units.
Let’s consider tiling square grids using polynominoes of any number of units.
If we separate all tetrominoes according to their perimeters, we would have two groups.
Polynominoes are figures made up of square units connected by edges.
Let’s consider tiling square grids with tetrominoes. Pieces can be rotated, reflected, and repeated as needed.
Consider trying to scramble a string of numbers, say 1, 2, 3, 4, 5, but with the requirement that none of the numbers can end up where they started. Let’s define this as a complete scramble.
For all questions in this problem, let’s ignore the effects of gravity, which means higher unit cubes can float in space without lower unit cubes to support them.
Continuing from last week’s problem about counting squares, let’s look at the related problem of counting the number of rectangles in a grid, with extensions
Sliding numbered blocks in a square grid to put them back in numerical order.
Constructing an unsolvable setup in a colour sorting game.
Connecting letters on the left to their matching letters on the right without crossing any lines.