Langton's ant: Difference between revisions

<lang D>import std.stdio, std.algorithm, std.traits;

enum width = 75, height = 52;

enum nsteps = 12_000;

auto M = new Color[][](height, width);

int x = width / 2;

int y = height / 2;

Directionauto dir = Direction.up;

for (int i = 0; i < nsteps &&

x >= 0 && y >= 0 && x < width && y < height; i++) {

Turnimmutable turn = M[y][x] == Color.black ? Turn.left : Turn.right;

M[y][x] = M[y][x] == Color.black ? Color.white : Color.black;

immutable dird = cast(Direction)((4 + dir + (turn == Turn.right ? +1 : -1)) % 4);

final switch(dir) {

case Direction.rightup: x y--; break;

case Direction.downright: y++x--; break;

case Direction.leftdown: xy++; break;

case Direction.left: } x++; break;

foreach (row; M)

writeln(cast(char[])row);