freeCodeCamp/problem-349-langtons-ant.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.3 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4ca1000cf542c50ffdc	5	false	Problem 349: Langton's ant	302008

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 degrees counterclockwise and moves forward one square. - if it is on a white square, it flips the color of the square to black, rotates 90 degrees clockwise and moves forward one square.

Starting with a grid that is entirely white, how many squares are black after 1018 moves of the ant?

Instructions

Tests

tests:
  - text: <code>euler349()</code> should return 115384615384614940.
    testString: assert.strictEqual(euler349(), 115384615384614940);

Challenge Seed

function euler349() {
  // Good luck!
  return true;
}

euler349();

Solution

// solution required

1.3 KiB Raw Blame History