THE education site for computer science and ICT

# 1. Introduction to Karnaugh Maps

Consider this complicated-looking boolean expression:

$$Q = A.B + \overline{(C+A+F)} + \overline B + C$$

Does it need to be this complicated? Can it be simplified?

This is where 'Karnaugh Maps' come in (pronounced 'carno'). They are a visual way of simplifying a boolean expression so that the fewest number of gates need to be used for the given function.

This is what a Karnaugh map looks like

We shall show you how to build and use karnaugh maps.

Challenge see if you can find out one extra fact on this topic that we haven't already told you

Click on this link: What is a karnaugh map