The last move in a region
If a cluster of empty squares is walled off by stable discs, the player who moves inside it may be the one who takes the final disc there. An odd number of empties in a region often favors the player about to move, because they can take the first and the last if the region stays isolated. An even number often favors the player who is waiting.
Regions do not stay isolated just because you want them to. A single move that opens a path between two areas merges the counts. That is why parity arguments fail in the opening, when the whole board is one region.
A careful way to use it
Wait until corners and long edges are stable enough that you can point at a group of empties and say it will not touch the rest. Then count. If you are the one who would be stuck taking a poisoned square, look for a pass in another region that changes who moves first.
The endgame page describes how a search just counts when the board is almost done. Parity is the human version of that count, used one region at a time.
The rest of the guide is on the strategy index. Try the idea in an Othello Game against the computer before you read the next note. Othello Game will not award the point for knowing the name of the idea. The board still has to agree.