Files

gikf c18554dd44 fix(curriculum): clean-up Project Euler 341-360 (#42998 )

* fix: clean-up Project Euler 341-360

* fix: improve wording

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

2021-07-29 19:14:22 +02:00

1.0 KiB

Raw Permalink Blame History

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f4ca1000cf542c50ffdc	Problem 349: Langton's ant	5	302008	problem-349-langtons-ant

--description--

An ant moves on a regular grid of squares that are coloured either black or white.

The ant is always oriented in one of the cardinal directions (left, right, up or down) and moves from square to adjacent square according to the following rules:

if it is on a black square, it flips the color of the square to white, rotates 90° counterclockwise and moves forward one square.
if it is on a white square, it flips the color of the square to black, rotates 90° clockwise and moves forward one square.

Starting with a grid that is entirely white, how many squares are black after {10}^{18} moves of the ant?

--hints--

langtonsAnt() should return 115384615384614940.

assert.strictEqual(langtonsAnt(), 115384615384614940);

--seed--

--seed-contents--

function langtonsAnt() {

  return true;
}

langtonsAnt();

--solutions--

// solution required

1.0 KiB Raw Permalink Blame History