Sliding block memory

From LifeWiki
Jump to navigation Jump to search

A sliding block memory is a memory register whose value is stored as the position of a block. The block can be moved by means of glider collisions. See block pusher for an example.

In Conway's original formulation, as part of his proof of the existence of a universal computer in Life, two gliders were used to pull the block inwards by three diagonal spaces as shown below, and thirty gliders were used to push it out by the same amount.

x = 12, y = 9, rule = B3/S23 2o$2o4$9b3o$3o6bo$o9bo$bo! #C [[ THUMBSIZE 2 THEME 6 GRID GRIDMAJOR 0 SUPPRESS THUMBLAUNCH ]] #C [[ THUMBNAIL THUMBSIZE 2 THEME 6 GRID GPS 10 LOOP 40 ZOOM 20 PAUSE 2 AUTOSTART ]]
(click above to open LifeViewer)
RLE: here Plaintext: here

Dean Hickerson later greatly improved on this,[1] finding a way to pull a block inwards by one diagonal space using 2 gliders, and push it out the same distance using 3 gliders. In order for the memory to be of any use there also has to be a way to read the value held. It suffices to be able to check whether the value is zero (as Conway did), or to be able to detect the transition from one to zero (as Hickerson did).

Dean Hickerson's sliding block memory is used in Paul Chapman's URM, and several other complex constructions such as Adam P. Goucher's pi calculator and Spartan universal computer-constructor, and David Bell's Collatz 5N+1 simulator.


  1. Dean Hickerson (March 1, 1990). "Description of sliding block memory". Paul Callahan's Game of Life Miscellany. Retrieved on February 17, 2018.

External links