Karnaugh Maps






For logical expressions the associated Karnaugh maps are created.
Up to a maximum of 6 arbitrary logical variables can be used.
Permissible operators are (decreasing in operator precedence in this order):
!~ "not"(negation)
&&* "and"(conjunction)
||+ "or"(disjunction)
In addition, braces can be used.

Alternatively, you can also edit a Karnaugh map cell by cell.
In either case, the associated minimized SOP (sum of products) is created.

The row and column headings use the usual notation for conjunctions in Karnaugh maps.
Furthermore, related column or line areas are marked in color.

A Karnaugh map for n variables has 2n cells, corresponding to the number of ways true and false combine.
Each cell represents the result of the logical expression (1 for true, 0 for false) with the conjunction of all n variables,
assigned as described by the column and row headings of the respective cell.

A diagram for n+1 variables is created here from a diagram for n variables by mirroring.
For even n it is reflected on the right edge and for odd n on the bottom edge.
Before building the diagram, the variables are lexically ordered.
The last and penultimate variable after sorting is then assigned differently in the two halves of the diagram.

If several Karnaugh maps are to be created in parallel, the associated expressions must be entered separated by semicolons.


more JavaScript applications