Boat-bit

Boat-bit
x = 25, y = 24, rule = B3/S23 6bo$7bo$5b3o8$16bo$14bobo$10b2o3b2o$11b2o$10bo10bob2o$21b2obo6$bo$b2o$ obo! #C [[ THUMBSIZE 2 THEME 6 GRID GRIDMAJOR 0 SUPPRESS THUMBLAUNCH ]]
View static image
Pattern type	Memory cell
Number of cells	11
Discovered by	Unknown
Year of discovery	Unknown
Pattern files RLE boatbit.rle

A boat-bit is a binary digit represented by the presence or absence of a boat next to a snake (or other suitable object, such as an aircraft carrier). The bit can be toggled by a glider travelling along a certain path. Such an object is sometimes called a snake-bit, although that name is less sensible because the snake can easily be replaced by other objects. A correctly timed glider on a crossing path can detect whether the transition was from 1 to 0 (in which case the crossing glider is deleted) or from 0 to 1 (in which case it passes unharmed). Three gliders therefore suffice for a non-destructive read.

The mechanisms involved in reading and writing a boat-bit are shown in the diagram below. The bit as shown in is the 0 state, with no boat present. It is about to be set to 1 by the incoming green glider, and then switched back to 0 again by the red glider. The first crossing glider will survive, but the second will be destroyed.

The picture in the infobox demonstrates the glider-based read and write mechanisms of a boat-bit

David Bell found a method of reading the bit while setting it to 0 in January 1997. It works by firing a middleweight spaceship at the boat-bit. If it is already 0 then the middleweight spaceship passes unharmed, but if it is 1 then the boat and the middleweight spaceship are destroyed and, with the help of an eater 1, converted into a glider that travels back along exactly the same path that is used by the gliders that toggle the boat-bit.

Other patterns that can be used to perform the boat-bit reaction include beacon (in its dense phase), table (if stabilised) and eater 1.

External links

• Boat-bit at the Life Lexicon