Polyplet

A polyplet (or simply a plet) is a finite collection of orthogonally or diagonally connected cells. The form of connectivity allowed by polyplets is sometimes called king-wise connectivity because of the way a king moves on a chess board. King-wise connectivity is a more natural concept in Life-like cellular automata than the orthogonal connectivity of polyominoes.

Sizes of polyplets

Polyplets with n cells for n = 3, 4, 5, ... are called triplets, tetraplets, pentaplets, hexaplets, heptaplets, and n-plets in general. The number of distinct polyplets with n cells for n = 1, 2, 3, ... is given by the sequence 1, 2, 5, 22, 94, 524, 3031, 18770, 118133, ... (Sloane's  A030222 ).

Triplets

There are exactly five distinct triplets, shown below. The first two are the two triominoes (pre-block and blinker), and the other three vanish after two generations (being the banana spark, V spark and a fuse of length 3 respectively).

The five distinct triplets.
Download RLE: click here

Tetraplets

Of the 22 distinct tetraplets:

The twenty-two distinct tetraplets.
Download RLE: click here

Pentaplets

The 94 distinct pentaplets evolve as follows:

  • 39 into nothing
  • 11 into loaves
  • 10 into traffic lights
    • 6 in the phase with "+" on even generations
    • 4 in the phase with "o" on even generations
  • 9 into beehives
  • 7 into boats (including the boat itself)
  • 4 into blocks
  • 4 into gliders (including the two that are themselves phases of the glider)
  • 3 into ponds
  • 2 into tubs
  • 1 into the pi heptomino (after two generations; the first generation evolution is the "<" hexomino)

The remaining four are or become the R-pentomino:

  • one is the R-pentomino itself
  • one becomes the R-pentomino after one generation
  • two become the aforementioned pentaplet after one generation (and thus become the R-pentomino after two).
gollark: ```javascript ■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■ 100% | ETA: 1s | 10000000/10000000<--- Last few GCs --->[2019:0x2495ba0] 182953 ms: Mark-sweep 1690.9 (1754.8) -> 1690.1 (1754.8) MB, 749.4 / 0.0 ms allocation failure GC in old space requested[2019:0x2495ba0] 183833 ms: Mark-sweep 1690.1 (1754.8) -> 1690.0 (1723.8) MB, 880.3 / 0.0 ms last resort GC in old space requested[2019:0x2495ba0] 184673 ms: Mark-sweep 1690.0 (1723.8) -> 1690.0 (1723.8) MB, 839.9 / 0.0 ms last resort GC in old space requested<--- JS stacktrace --->==== JS stack trace =========================================Security context: 0x1937f18a55e9 <JSObject> 2: clearBuffer(aka clearBuffer) [_stream_writable.js:499] [bytecode=0x3c274695f9f1 offset=41](this=0x900cbe822d1 <undefined>,stream=0x2bd67ccd4929 <TLSSocket map = 0x3f955b4062a1>,state=0x2bd67ccd47e9 <WritableState map = 0x307ed1cd7b81>) 3: onwrite(aka onwrite) [_stream_writable.js:462] [bytecode=0x3c2746954081 offset=91](this=0x900cbe822d1 <undefined>,stream=0x2bd67ccd4929 <TLSSocket m...FATAL ERROR: CALL_AND_RETRY_LAST Allocation failed - JavaScript heap out of memory 1: node::Abort() [node] 2: 0x8d05bc [node] 3: v8::Utils::ReportOOMFailure(char const*, bool) [node] 4: v8::internal::V8::FatalProcessOutOfMemory(char const*, bool) [node] 5: v8::internal::Factory::NewUninitializedFixedArray(int) [node] 6: 0xd8c6bc [node] 7: 0xda5b78 [node] 8: 0xda60db [node] 9: v8::internal::JSArray::SetLength(v8::internal::Handle<v8::internal::JSArray>, unsigned int) [node]10: v8::internal::ArrayConstructInitializeElements(v8::internal::Handle<v8::internal::JSArray>, v8::internal::Arguments*) [node]11: v8::internal::Runtime_NewArray(int, v8::internal::Object**, v8::internal::Isolate*) [node]12: 0x1af0a27042fdfish: “node incredec.js up 10000000” terminated by signal SIGABRT (Abort)```Best language runtime!
gollark: And `Promise.resolve` which seems returney.
gollark: I mean, they have `then` which seems bindy.
gollark: I think so...
gollark: Promises!
This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.