Summary: One word. It is printed above the grid, so you always know what you are looking for — and it is hidden in there a dozen times or more. Your answer is not where it is. It is how many.
Overview
An ordinary word search gives you a list of words and asks you to find them. A Count Word Search takes the list away and replaces it with a number.
You get one word, printed above the grid, because without it there is no puzzle. What you are not given is how many times it is in there — and that count is the answer you write in the box.
You still have to find every copy. “Count” is only what you write down; there is no trick that gets you to the number without reading the grid.
The puzzle above hides KOKKIN (Dutch: female cook) in a 15 × 13 grid. Look at the letters: there are only four of them in the whole grid — K, O, I and N, the letters of the word itself. Every square is a fragment of the answer. The solution on the right rings all twelve copies.
The Rules
- One word is named, and it is hidden many times. The word is printed with the puzzle. Its positions are not, because they are the answer.
- Words read in eight directions — across, down, both diagonals, and each of those backwards. Every direction a straight line can run on a square grid counts, no matter which directions the puzzle maker allowed when hiding them.
- Count every distinct copy. Two copies normally cross at a single shared letter; some settings also let two copies run along the same line sharing several letters. Either way, a different set of squares means a different copy, and both count.
- One copy read two ways is still one copy. This only comes up with a palindrome — if the word reads the same forwards and backwards, the same squares are not counted twice.
- Write the total in the answer box. The box has one square per digit of the highest count the setter allowed for the whole book, so every page shows the same number of squares. It tells you nothing about this page’s answer.
The count is the whole puzzle. There is no other thing to find and nothing to shade in.
How to Start Solving
Anchor on the word’s rarest letter. Note where it sits in the word, find every one of them in the grid, and read outwards in both directions along all four lines through it. In a grid with ordinary filler this is much cheaper than scanning for whole words. In a grid built from the word’s own letters — like the KOKKIN board above — there is no rare letter, which is exactly what makes that setting hard, and the sweep below becomes the only reliable method.
Sweep in one direction at a time. Read every row left to right, then every row right to left, then every column down, then up, then the two diagonal families — down-right and up-right — each swept both ways. Eight passes in all. It is slower than scanning for shapes, but you cannot miss one, with a single exception: if your word is a palindrome, the forward and backward passes find the same squares twice, so count those once.
Ring each copy and keep a tally. Ring the copy as you see it and add a stroke to a tally in the margin at the same moment. At a dozen copies on a small grid the rings will overlap at crossings, and it is the tally, not the rings, that you finally read off.
Do not stop at the number you expect. A page of these usually varies the answer from puzzle to puzzle. If the last one was eleven, this one is not necessarily eleven.
A worked count
Take the puzzle at the top of this page. Sweeping it in those eight passes turns up copies running across, down, and on both diagonals — including several that cross each other, sharing a single letter. Ringing each and tallying as you go gives 12, which is the number in the answer box on the solution. Nothing about the two empty squares on the puzzle sheet told you that: a two-square box would have looked identical if the answer had been 9.
Why the Grid Is So Hard to Read
The filler letters — everything that is not part of a hidden copy — are what set the difficulty, and this puzzle type has an unusually wide range.
Both grids hide KOKKIN. On the left the filler is the whole alphabet, so K, O, I and N are the only letters that repeat and the copies almost announce themselves — you can find them by pattern alone, without reading. On the right the filler is drawn from the word’s own four letters, so nothing stands out, every run of letters is nearly the word, and there is no shortcut but to read.
This is the same puzzle at two very different difficulties, and it is one setting.
Variants You Will See
More than one word on a grid. Some pages hide two or three different words in the same grid, each with its own count and its own answer line. Every word gets its own number — they are separate questions sharing one board.
The grid above hides AUTUMN, HARVEST and PUMPKIN. The answers are 9, 7 and 9. Each word’s count is drawn independently, so finding one word’s total tells you nothing about the next.
Two words that are anagram-reverses of each other, like DOG and GOD, never share a grid. Because counting reads all eight directions whatever the puzzle maker allowed, every line spelling one spells the other backwards, so the two answers would always be identical and the second question would be pointless. The second word simply moves to the next puzzle, where it works fine.
Shaped grids. The grid does not have to be a rectangle. A silhouette leaves a stepped outline, and the letters fill only the shape.
The rules do not change — words still read in straight lines, in eight directions. There are simply fewer squares, which is worth remembering: a shaped grid holds fewer copies than the rectangle it was cut from.
Easier direction sets. Puzzles made for children often restrict the hiding to right, down and down-right. If backwards reading is switched off as well, the word only ever reads forward, which cuts the sweep from eight passes to three. The counting rule itself never changes.
Why It Is Worth Solving
A word search is a recognition task: you know the shape you want and your eye finds it. Counting is a completeness task — you have to run an exhaustive search and keep an accurate tally without double-counting, which is a different and more demanding discipline, and the same one behind checking your own work in arithmetic.
It suits the kind of sitting where you want to slow down rather than race; one grid can hold your attention for ten quiet minutes. And you always know whether you were right: the answer is a single number, so there is nothing to argue with.
FAQ
If two copies overlap, do they both count?
Yes. Copies cross at a shared letter, and some settings let two copies run along the same line sharing several letters — as long as they occupy a different set of squares, they are separate copies. The only case where the same squares are not counted twice is a palindrome read in both directions, which is one copy.
Can the word appear by accident in the filler letters?
No. After the grid is filled, it is scanned in all eight directions and any accidental occurrence is repaired by re-rolling the filler letters involved; a grid that cannot be cleared is discarded rather than printed. So the printed answer is exactly what is findable — which matters most with the word’s-own-letters filler, where accidents would otherwise be very likely.
What if a shorter word is hidden inside a longer one?
It counts. On a grid hiding both POWER and SUPERPOWER, the POWER inside each SUPERPOWER is a genuine, findable occurrence of POWER, so it is included in POWER’s answer.
How many times is the word usually hidden?
Ten to fourteen is the usual range, which fills a typical grid without crowding it. The puzzle maker sets the range, bounded by what the grid can physically hold — a big count needs a big grid — and a book normally varies it page to page so the answer is never predictable.
Is there always exactly one right answer?
Yes. The answer is counted from the finished grid rather than from what was requested, so the number printed in the answer key is the number a careful solver can actually find.
Does the size of the answer box give anything away?
No, and it is designed not to. The squares are sized from the highest count allowed anywhere in that book, so every page carries the same box whatever its own answer is.