TOPICS
Search

Polystick


A polystick is a polyform consisting of a finite nonempty connected union of unit line segments that are edges of a regular grid. Segments meet at their endpoints, and closed loops are allowed. Pieces are identified under translations, rotations, and reflections that preserve the grid. Polysticks are sometimes also known as polyedges.

PolyedgeGrid

Square polysticks are polyforms obtained from the edges of a regular square grid, illustrated above.

Polyedges

The numbers of square polysticks with n=1, 2, ... components are 1, 2, 5, 16, 55, 222, 950, 4265, ... (OEIS A019988), the first few of which are illustrated above.

TriangularPolyedgeGrid

Triangular polysticks are polyforms obtained from the edges of a regular triangular grid, illustrated above.

TriangularPolyedges

The numbers of triangular polysticks with n=1, 2, ... components are 1, 3, 12, 60, 375, 2613, 19074, 143660, ... (OEIS A159867), the first few of which are illustrated above.


See also

Polyedge, Polyform, Square Grid, Triangular Grid

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

References

Clarke, A. L. "The Poly Pages." http://www.recmath.com/PolyPages/.Goodger, D. "Polysticks Puzzles & Solutions." https://puzzler.sourceforge.net/docs/polysticks.html.Owen, B. "Polyforms." https://web.archive.org/web/20060619124305/http://groups.yahoo.com/group/polyforms/.Sloane, N. J. A. Sequences A019988 and A159867 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Polystick

Cite this as:

Weisstein, Eric W. "Polystick." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Polystick.html

Subject classifications