2018-09-30 22:01:58 +00:00
---
id: 5900f4591000cf542c50ff6c
title: 'Problem 237: Tours on a 4 x n playing board'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 301882
2021-01-13 02:31:00 +00:00
dashedName: problem-237-tours-on-a-4-x-n-playing-board
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2021-07-15 12:26:34 +00:00
Let $T(n)$ be the number of tours over a 4 × $n$ playing board such that:
2020-11-27 18:02:05 +00:00
2021-07-15 12:26:34 +00:00
- 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.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
The diagram shows one tour over a 4 × 10 board:
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
< img class = "img-responsive center-block" alt = "one tour over 4 x 10 board" src = "https://cdn.freecodecamp.org/curriculum/project-euler/tours-on-a-4-x-n-playing-board.gif" style = "background-color: white; padding: 10px;" >
$T(10)$ is 2329. What is $T({10}^{12})$ modulo ${10}^8$?
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2021-07-15 12:26:34 +00:00
`toursOnPlayingBoard()` should return `15836928` .
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
2021-07-15 12:26:34 +00:00
assert.strictEqual(toursOnPlayingBoard(), 15836928);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --seed--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
2021-07-15 12:26:34 +00:00
function toursOnPlayingBoard() {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return true;
}
2021-07-15 12:26:34 +00:00
toursOnPlayingBoard();
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```