WordFlow

WordFlow is a timed word chain. The top word is given in full, and each following word must form a common expression with the one before it, like the game's example chaining game then show. The first letter of each word is provided, the rest must be guessed, and the clock is running: every fifteen seconds the game gives you an extra letter, counted as a fault.

1. Press START: the timer starts and the line to complete is highlighted.
2. Read the word above and look for the common expression it forms with the word to find.
3. Type the answer, the first letter of each line already being in place.
4. Move down the chain line by line to the last word.
5. If you're stuck, wait for the countdown or press Next Letter; the rules state that each revealed letter counts as a fault.

The idea is simple and rare: a chain where each link is a common expression, so a game that tests the ear for ready-made associations more than vocabulary. The timer makes it tense without ever eliminating you, since you will finish the chain anyway: the only question is how many letters the game will have had to whisper to you. It's a pride score rather than a win condition, which makes failure bearable and the performance perfectly readable.

Two counters frame the active line: on the left a countdown toward the next letter, on the right a faults counter on a red badge, at zero as long as nothing has been revealed. The current line is circled, the others sit back with their initial already placed, and a chain link connects each word to the next. The number of boxes in a line indicates the length of the word to find.

Daily Puzzle

A chain numbered and dated per day, under the displayed promise "A new puzzle every day".

• Length is given by the number of boxes: count them before searching for the expression; that eliminates half of the candidates.
• The Next Letter button only anticipates a letter the timer would have given anyway. The rules say each revealed letter is a fault, so buying time doesn't cost more, but it doesn't cost less either.
• The chain reads both ways: a stubborn word can be deduced from the one below it, whose initial is already visible.