Return to Question

What is the fewest positive number of polyominoes P, such that

• You can place grid aligned copies of P without any overlap; and
• Each polyomino is adjacent to exactly 3 other polyominoes.

Polyominoes are the same shape, but can be rotated or flipped. Two polyominoes are considered adjacent if they touch at one of their sides (not vertices).

What is the smallest positive number of polyominoes P, such that

• You can place grid aligned copies of P without any overlap; and
• Each polyomino is adjacent to exactly 3 other polyominoes.

Polyominoes must be the same shape, but can be rotated or flipped. Two polyominoes are considered adjacent if they touch at one of their sides (not vertices).

What is the fewest positive number of polyominoes P, such that

• You can place grid aligned copies of P without any overlap; and
• Each polyomino is adjacent to exactly 3 other polyominoes.

Polyominoes can be rotated or flipped. Two polyominoes are considered adjacent if they touch at one of their sides (not vertices).

What is the fewest positive number of polyominoes P, such that

• You can place grid aligned copies of P without any overlap; and
• Each polyomino is adjacent to exactly 3 other polyominoes.

Polyominoes are the same shape, but can be rotated or flipped. Two polyominoes are considered adjacent if they touch at one of their sides (not vertices).

What is the fewest number of polyominoes P, such that

• You can place grid aligned copies of P without any overlap; and
• Each polyomino is adjacent to exactly 3 other polyominoes.

Polyominoes can be rotated or flipped. Two polyominoes are considered adjacent if they touch at one of their sides (not vertices).

What is the fewest positive number of polyominoes P, such that

• You can place grid aligned copies of P without any overlap; and
• Each polyomino is adjacent to exactly 3 other polyominoes.

Polyominoes can be rotated or flipped. Two polyominoes are considered adjacent if they touch at one of their sides (not vertices).