# Karnaugh map

ABCD | 00 | 01 | 11 | 10 |

00 | 0 | 0 | 0 | 0 |

01 | 0 | 0 | 0 | 0 |

11 | 0 | 0 | 0 | 0 |

10 | 0 | 0 | 0 | 0 |

This Karnaugh map solver allows you to simplify Boolean algebraic functions easily and efficiently.

## Instructions

Enter the variable names in the provided text field, choose the canonical form you want as the result (sum of products or product of sums), and finally, select the values (0, 1, or X) for every possible combination of values. The tool will automatically display the result.

## What is a Karnaugh map?

The Karnaugh map, also known as K-map, was invented in 1953 by Maurice Karnaugh, a physicist and mathematician at Bell Laboratories. The map is primarily used to simplify Boolean functions, especially those represented by truth tables or complicated algebraic expressions.

The Karnaugh map represents all possible combinations of inputs in a two-dimensional table, where each cell represents an input state and is associated with the corresponding output value. By grouping adjacent cells with an output value of 1, patterns can be identified, and the original Boolean expression can be simplified. This can result in a more efficient and easier-to-understand circuit implementation.

## Support this website

If this page has been useful, share it with your contacts by email, social networks,... etc.