Karnaughn´n kartta voidaan piirtää myös usealla muulla tavalla. Mitkä tahansa kaksi muuttujaa voidaan vaihtaa keskenään tai minkä tahansa muuttujan 0- ja 1-alueet voidaan vaihtaa keskenään.
The structure of a karnaugh map is grid shaped. The two most typical sizes used for instruction or for small projects is the three varible (a 2x4 grid or 4x2 depending on the user) and the four varible map (4x4 grid).
[[Image:K-map 6,8,9,10,11,12,13,14.svg|right|frame|An example of a four variable Karnuagh Map]]
===Karnaugh'n kartan täyttäminen **KESKEN**===
K-maps can only be created if a truth table is present its different for sequential logic but that will be discussed later. A finshed K-map can make a truth table, or a boolean equation vice versa. Once a truth table is acquired, a Karnaugh map can be created. The top left corner(or sometimes just the top and the left) of a K-map shows the varibles used for that side.The picture of the K-map example shows the varibles associted to that side. The top is A and B and the numbers below them is the state A and B are for that column (i.e. The column 10 is when A is true(high) and B is false(low)). From the truth table we put its output in the corresponding squares (i.e. If on the truth table when ABCD is 1011 and the output was 1, then on the four varible map, a 1 would go in the fourth column, second row). The following example shows how to translate a truth table to a K-map and then turn the K-map into a boolean equation.
