Suppose I have a grid of black/white squares (not necessarily all white). How can I prove that Langton's ant is unbounded when it runs on this initial condition?
It seems as though the way to go about this is noting that if it were bounded, it's periodic and achieving a contradiction by looking at the neighbours of the initial square. However, this approach hasn't worked so far for me.