Hivenudger

Hivenudger is a c/2 orthogonal spaceship found by Hartmut Holzwart in July 1992 and named by Bill Gosper. It consists of a pre-beehive escorted by four lightweight spaceships. In fact, any lightweight spaceship can be replaced by a middleweight spaceship or a heavyweight spaceship, so that there are 45 different single-hive hivenudgers (shown below), all of which have been synthesized.

Hivenudger
<html><div class="rle"><div class="codebox"><div style="display:none;"><code></html>x = 13, y = 13, rule = B3/S23 4o5bo2bo$o3bo3bo$o7bo3bo$bo2bo3b4o2$5b2o$5b2o$5b2o2$bo2bo3b4o$o7bo3bo$ o3bo3bo$4o5bo2bo! #C [[ THUMBSIZE 2 THEME 6 GRID GRIDMAJOR 0 SUPPRESS THUMBLAUNCH ]] #C [[ AUTOSTART ]] <nowiki>#C [[ GPS 2 ZOOM 14 TRACKLOOP 4 -1/2 0 ]]</nowiki> <html></code></div></div><canvas width="200" height="300" style="margin-left:1px;"><noscript></html> <html></noscript></canvas></div></html>
View animated image
View static image
Pattern type Tagalong
Spaceship
Number of cells 42
Bounding box 13×13
Direction Orthogonal
Period 4
Mod 4
Speed c/2
Speed (unsimplified) 2c/4
Heat 51.0
Discovered by Hartmut Holzwart
Year of discovery 1992

Further hivenudger variants can be created by replacing either back spaceship with a sidecar, a Coe ship, a hammerhead, a Pushalong 1 or another hivenudger.

The 45 distinct hivenudgers.
Download RLE: click here
gollark: That sounds doable.
gollark: Oh yes, I'll just use Rust's stdlib in my glorious C.
gollark: Well, it does at most `(arrayorsomethinglength * arrayorsomethinglength * arrayorsomethinglength * 3) / 2` iterations.
gollark: *And* it terminates in bounded time.
gollark: It's optimized because it uses XOR over inefficient temporary variables.

See also
  • 42P4H2V0.42 at Heinrich Koenig's Game of Life Object Catalogs
This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.