Pick a line (a row or column) with a clue containing only one number, n, whose value is more than half the line length, then imagine you have a block of solids of length n which you can place in the line and slide about. Imagine pushing the block as far as it goes into one end of the line, then imagine pushing it similarly into the other end, e.g. for a 10-cell line with the rule ‘6’:
6, pushed left |
||||||||||
6, pushed right |
Because the block is longer than half the line's length, there is an overlap in the middle. There is no way for either of these cells to be dots, so you can shade them in as solids:
6 |
Sometimes you already know the state of some of the cells, because you determined them from the lines perpendicular to the line you're working on currently. This might allow you to solve more of the current line than what you would have been able to if it was empty:
6, before |
||||||||||
6, pushed left |
||||||||||
6, pushed right |
||||||||||
6, after |
You can determine which cells can only have dots in them when a gap of adjacent blank cells is too small for a solid block:
4, before |
||||||||||||||
4, after |
or when all solids are accounted for:
2, before |
||||||||
2, after |
These tactics can also be adapted and applied to lines with more than one solid block. In general, you imagine each as a sliding block, all of them on the line together, but free to slide around. They are always separated by at least one dot, never overlap, and never change their order. You should try to find all the possible ways for them to fit into the line without contradicting what's there already. If there are some cells that cannot be both solids and dots despite all the different arrangements, you can fill them in.