moncyb's Journal: Karnaugh Maps

Just making notes.

Karnaugh Maps -- an easy way to simplify boolean expressions. Draw a two dimensional grid, the X/Y axis are the different possible inputs, and the cells contain the desired output. Inputs are expressed as the value if input is true, or the not value if input is false. Surround all ones/on/true with the largest circles possible (widths only in 2 to the Xth power). The inputs which contain both true and false values within the circle can be eliminated. Inputs which are only true -> the value. Inputs which are only false -> the inverted (not) value. The resultant values for a circle are ANDed together, and all the circle expressions are ORed toether.

• Wikipedia entry
• maxmon From some book called "Bebop to the Boolean Boogie"...looks kind of interesting...
• Common error when chosing circles
• nist.gov

Hmmm...may make a fun video game. Probably better than Minesweeper!

Good Luck

[LPetrazickis]

Hmmm...may make a fun video game. Probably better than Minesweeper!

I am not sure if that would work all that great. K-maps are easy to master. Well, ones with four variables anyway. Eight-variable Karnaugh maps could be interesting.:P

Re:Good Luck

[moncyb]

Well, I try anything when I feel I have the time. Then again, I'll probably do my usual "half finish the project, then get distracted and start a different one later" thing.