2018-09-30 22:01:58 +00:00
---
id: 5900f5371000cf542c51004a
title: 'Problem 459: Flipping game'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 302133
2021-01-13 02:31:00 +00:00
dashedName: problem-459-flipping-game
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2018-09-30 22:01:58 +00:00
The flipping game is a two player game played on a N by N square board.
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
Each square contains a disk with one side white and one side black.
2020-11-27 18:02:05 +00:00
The game starts with all disks showing their white side.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
A turn consists of flipping all disks in a rectangle with the following properties: the upper right corner of the rectangle contains a white disk the rectangle width is a perfect square (1, 4, 9, 16, ...) the rectangle height is a triangular number (1, 3, 6, 10, ...)
2018-09-30 22:01:58 +00:00
Players alternate turns. A player wins by turning the grid all black.
2020-11-27 18:02:05 +00:00
Let W(N) be the number of winning moves for the first player on a N by N board with all disks white, assuming perfect play. W(1) = 1, W(2) = 0, W(5) = 8 and W(102) = 31395.
2018-09-30 22:01:58 +00:00
For N=5, the first player's eight winning first moves are:
Find W(106).
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`euler459()` should return 3996390106631.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert.strictEqual(euler459(), 3996390106631);
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
function euler459() {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return true;
}
euler459();
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```