This hole is experimental, no solutions will be saved. Please leave feedback on the GitHub issue.

Polyominoes

Details

A polyomino is a shape formed by joining a certain amount of squares together, where each square must be linked together. Output each possible polyomino (including every rotation), up to a size of 6, in any order. Separate each polyomino by an empty line.

There should be a total of 1 monomino, 2 dominoes, 6 trominoes, 19 tetrominoes, 63 pentominoes and 216 hexominoes.

The output judge is order agnostic. The expected output shown is one of many valid outputs.
0 bytes, 0 chars
Restore solution
All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
Fennel is an experimental language, no solutions will be saved. Please leave feedback on the GitHub issue.
Uiua is an experimental language, no solutions will be saved. Please leave feedback on the GitHub issue.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Polyominoes?

If you have separate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.