freeCodeCamp

1.0 KiB

Raw Blame History

id	challengeType	title	forumTopicId
5900f4591000cf542c50ff6c	5	Problem 237: Tours on a 4 x n playing board	301882

Description

Let T(n) be the number of tours over a 4 × n playing board such that: The tour starts in the top left corner. The tour consists of moves that are up, down, left, or right one square. The tour visits each square exactly once. The tour ends in the bottom left corner. The diagram shows one tour over a 4 × 10 board:

T(10) is 2329. What is T(1012) modulo 108?

Instructions

Tests

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

Challenge Seed

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

euler237();

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape