diVid

Worked examples

A chain banks when its total divides evenly by the key and every tile is linked to the rest.

Example #1
Valid chain · 230 pts
Key
7
356
3 + 5 + 6 = 14
14 ÷ 7 = 2 rem 0
(3² + 14) × 10 = 230 pts

Three linked tiles totalling 14; the remainder is 0, so every tile turns green and the chain banks.

Example #2
Non-zero remainder · 0 pts
Key
6
2684
2 + 6 + 8 + 4 = 20
20 ÷ 6 = 3 rem 2
(4² + 20) × 10 = 0 pts

Four linked tiles totalling 20; one tile in the chain touches at a corner, which counts. But the remainder isn't 0, so the tiles stay gold and nothing banks.

Example #3
Broken chain · 0 pts
Key
3
42
4 + 2 = 6
6 ÷ 3 = 2 rem 0
(2² + 6) × 10 = 0 pts
tiles apart · broken chain

Both tiles divide by the key, but they don't touch, so it's a broken chain: the tiles stay pale and earn nothing.

Back to the start