51 lines
819 B
Markdown
51 lines
819 B
Markdown
|
---
|
|||
|
|
id: 5900f4591000cf542c50ff6c
|
|||
|
|
title: 'Problem 237: Tours on a 4 x n playing board'
|
|||
|
|
challengeType: 5
|
|||
|
|
forumTopicId: 301882
|
|||
|
|
dashedName: problem-237-tours-on-a-4-x-n-playing-board
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
# --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?
|
|||
|
|
|
|||
|
|
# --hints--
|
|||
|
|
|
|||
|
|
`euler237()` should return 15836928.
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
assert.strictEqual(euler237(), 15836928);
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
# --seed--
|
|||
|
|
|
|||
|
|
## --seed-contents--
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler237() {
|
|||
|
|
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler237();
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
# --solutions--
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|