An octomino (or 8-omino) is a polyomino of order 8; that is, a polygon in the plane made of 8 equal-sized squares connected edge to edge. [1] When rotations and reflections are not considered to be distinct shapes, there are 369 different free octominoes.

3 天之前 · An octomino is an 8-polyomino. There are 369 free (illustrated above), 704 one-sided, and 2725 fixed octominoes.

Octomino （或8-Omino ）是阶8的多粒子，即由8个等尺寸的正方形连接的边缘到边缘的平面中的多边形。 当旋转和反射不被认为是不同的形状时，有369个不同的八叶群落。

2018年7月20日 · POLYOMINOES, a MATLAB library of functions for the polyomino tiling problem. Users interested in trying out the library by working throught the problems discusses in the paper might start with the SCRIPTS, which set up sample problems and handle the plotting of solutions.

All 369 distinct octominoes (polyominoes, or tetris pieces, with 8 cells) can perfectly cover a rectangle together, except for the 6 pieces which contain a hole. Here these 6 quarrellers are nicely...

2023年11月18日 · 这叫polyomino，叫多连块也行，比如多米诺（domino）其实就是两连块的意思。 polyominoes: monomino, domino, tromino, tetromino, pentomino, hexomino, heptomino, octomino, enneomino, decomino, hendecomino, dodecomino… 至于求 通项公式，最简单的方法就是拿前几项去 OEIS 上搜，但很遗憾你前几项数错了所以搜不着。 正解是 A000105： 1, 1, 2, 5, 12, 35, 108, 369, 1285, 4655… 上表中CPU计算时间可以作为本题的回答。 连块的数学定义我 …

(geometry) A polyomino made up of eight squares.

All the prime rectangles for this octomino were determined by Klarner [1, Theorem 6 and Figure 15].

2019年3月3日 · POLYOMINO_MULTIHEDRAL_EXAMPLE_OCTOMINO, a MATLAB program which sets up a problem in which an 8x8 square is to be tiled by 8 distinct octominoes. Because this problem results in a large linear system to be solved, we simply set up the linear system, write it to an LP file, and have CPLEX compute all solutions.

2025年3月29日 · Polyominoes of with n cells for n = 1, 2, 3, 4, ... are called haplominoes, dominoes, triominoes, tetrominoes, pentominoes, hexominoes, heptominoes, octominoes, and n-ominoes in general. The number of distinct polyominoes with n cells for n = 1, 2, 3, ... is given by the sequence 1, 1, 2, 5, 12, 35, 108, 369, 1285, ... (A000105 on the OEIS).