3-Variable Karnaugh Maps and the Wraparound Rule
Three variables means eight minterms, too many for a single row or column. The standard layout splits them 1-and-2: one variable controls two rows, the other two control four columns labeled in Gray code order, 00, 01, 11, 10. That order isn't counting order, it's arranged so each column differs from its neighbor by exactly one bit.
The Wraparound Rule
Look at the two ends of that Gray code sequence: 00 and 10. They aren't next to each other in the row, they sit on opposite sides of the grid, but they still differ in exactly one bit. That means the leftmost and rightmost columns of a Karnaugh map are just as adjacent as any two side-by-side columns, the grid effectively wraps around into a cylinder. The same rule applies to the top and bottom row whenever a map has more than one row.
Why Wraparound Is Legal, Not a Special Case
This isn't a special case bolted onto the grouping rule, it falls straight out of it. A group is legal exactly when every cell in it shares the same fixed values for some subset of variables. Algebra doesn't know or care where a cell happens to sit on a printed page, only whether the underlying minterms differ in a single variable, and the columns 00 and 10 do exactly that.
Worked Example: F = C'
Here's a function picked specifically to force a wraparound group: F(A, B, C) is 1 whenever C is 0, regardless of A or B. Try grouping the four 1s into a single group of four. You'll need to select cells from both the leftmost and rightmost columns to do it.
Click the 1s you think belong together, then check your group.
F = ?
All four selected cells share C = 0 and let A and B vary freely across every combination, so C is the only variable that survives, giving the single term C'. Four cells canceling two variables at once is exactly the "group size must be a power of two, and bigger is better" rule from the fundamentals guide, this example just happens to need the wraparound to reach that size.
Group cells at C=0: {A'B'C', A'BC', AB'C', ABC'}
All four share C = 0. A and B take every combination between them.
=> only C' survives -> F = C'At four variables the wraparound rule applies along both the rows and the columns simultaneously, which produces one more shape worth knowing by name: the four corners.