Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
124 views

Oscillator in Langton's ant

First of all, see Langton's ant Wikipedia page. If we place a pair of ants looking north (using Golly or any another prog) on the coordinates $(x_1,y_1)$ and $(x_2,y_2)$ under the conditions: $p=|x_1-...
Notamathematician's user avatar
7 votes
0 answers
1k views

Absolute oscillator in Langton's Ant

We have a simple (or single) block of Langton's Ants colony which includes two ants looking in the same direction. Their positions can be interpreted as knight's walk. The distances between each next ...
user514787's user avatar
1 vote
0 answers
125 views

Minimal period for a bounded Langton's ant moving on a tessellation

We consider Langton's ant on the 2D plane, but we replace the square lattice by a Voronoi tessellation obtained from a finite set of points (it could be another tessellation, however directions such ...
ahstat's user avatar
  • 111
8 votes
1 answer
436 views

The graph of Rule 110 and vertices degree

Consider the elementary cellular automaton called Rule 110 (famous for being Turing complete): It induces a map $R: \mathbb{N} \to \mathbb{N}$ such that the binary representation of $R(n)$ is ...
Sebastien Palcoux's user avatar
31 votes
1 answer
1k views

Vanishing line on Conway's game of life

If the initial state of Conway's game of life is a line of $n \in [0,100]$ alive cells, then it vanishes completely after some steps iff $n \in \{0,1,2,6,14,15,18,19,23,24 \}$. See below for $n=24$. ...
Sebastien Palcoux's user avatar
14 votes
2 answers
731 views

Blinking graphs

For any simple graph $G$, assign its nodes a weight/bit of $0$ or $1$. Call this a bit assignment for $G$. Now, generate a new bit assignment as follows: Each node $x$'s bit is replaced by $1$ if the ...
Joseph O'Rourke's user avatar
13 votes
1 answer
597 views

Does Langton's ant cover every n by 6 gridded torus?

This post follows this other post about times cover by Langton's ant of $n$ by $n$ gridded torus. For $n$ by $n$ gridded torus, I've checked for $n \le 1000$ that the ant covers all. This fact needs ...
Sebastien Palcoux's user avatar
23 votes
1 answer
2k views

Time for Langton's ant to cover a "square" torus

Langton's ant is a cellular automaton running as follows: Squares on a plane are colored variously either black or white. We arbitrarily identify one square as the "ant". The ant can travel in ...
Sebastien Palcoux's user avatar