K-Map Solver

Description

This MicroSim provides an interactive Karnaugh map for simplifying Boolean functions. Students can click cells to set values (0, 1, or don't care), then solve to find the minimal Sum of Products expression. The tool visualizes prime implicants with colored groupings and displays the resulting simplified expression.

Key Features

● Interactive K-map: Click cells to toggle between 0, 1, and X (don't care)
● Variable support: Works with 2, 3, or 4 variables
● Auto-grouping: Automatically identifies optimal prime implicant groups
● Visual highlighting: Color-coded groups show which minterms combine
● Minimal expression: Displays the simplified SOP expression

Learning Objectives

Bloom Level: Analyze (L4)

After using this MicroSim, students will be able to:

✓ Create K-maps for 2-4 variable Boolean functions
✓ Identify valid groupings (powers of 2, rectangular shapes)
✓ Recognize Gray code ordering and adjacency in K-maps
✓ Use don't care conditions to create larger groups
✓ Derive minimal SOP expressions from K-map groupings

How to Use

Select the number of variables (2, 3, or 4)
Click cells to toggle values: 0 → 1 → X (don't care) → 0
Click "Solve" to find the minimal expression
Observe the colored groups showing prime implicants
Click "Clear" to reset and try a new function

Lesson Plan

Before the Simulation (5 minutes)

Review minterm representation and SOP form
Explain Gray code ordering and logical adjacency

During the Simulation (15 minutes)

Start with a 2-variable function: click to set F(0,0)=1, F(1,1)=1
Solve and observe the grouping
Move to 3 variables: try F = Σm(1,3,5,7)
Notice how the column of 1s forms one group
Try a 4-variable function with don't cares
Compare expressions with and without using don't cares

After the Simulation (5 minutes)

Practice finding groups manually before clicking Solve
Discuss cases with multiple minimal solutions