Karnaugh Maps & Boolean Algebra, Explained Properly
Worked-example guides for digital logic students and engineers — covering the methods behind the solver itself, not just button-clicking instructions.
How to Solve a 4-Variable POS K-Map from Maxterms
Derive a minimized POS expression by grouping zeros, translating maxterms, and checking every cell.
Worked ExamplesSix-Variable K-Map: A Complete Worked Example Across Four Tiles
Place six-variable minterms across four tiles, group across tile boundaries, and verify the result.
K-Map SkillsWhy Greedy K-Map Grouping Can Miss the Minimum
A four-minterm counterexample shows why a locally reasonable group can require an extra term.
K-Map SkillsWhy Different K-Map Answers Can Both Be Minimal
Compare two equivalent minimum covers and learn how to verify alternate answers.
FundamentalsMinterm Numbering and Variable Order: A Clear Guide
Convert binary input rows to minterm indices and place them correctly on a Gray-code map.
MethodsQuine–McCluskey Method: A Complete Worked Example
Follow the tabulation rounds, prime implicant chart, and minimum cover for a four-variable function.
Circuit DesignStatic-0 Hazards in POS Logic: A K-Map Example
Find an uncovered adjacent zero pair and add a redundant maxterm to protect a POS transition.
Circuit DesignStatic vs. Dynamic Hazards in Digital Logic
Distinguish static-1, static-0, and dynamic hazards and learn what K-maps can detect.
Circuit DesignFrom FSM State Table to K-Map Next-State Equations
Turn a state table into separate next-state maps and verify a D-flip-flop implementation.
Circuit DesignFSM Unused State Codes: When Are They Safe Don’t-Cares?
Decide when unused state codes can be X values and when recovery behavior must be specified.
Circuit DesignBinary vs. One-Hot State Encoding: How the Choice Changes Logic
Compare state bits, next-state equations, output decode, and invalid-state behavior.
Circuit DesignDesign a Modulo-6 Synchronous Counter with K-Maps
Derive a three-bit counter and define recovery transitions for both unused codes.
Circuit DesignJK Flip-Flop Excitation Equations from K-Maps
Use the JK excitation table to derive and verify a two-bit synchronous counter.
Circuit DesignMoore vs. Mealy Machines: Output Logic with a K-Map Example
Compare edge-detector state tables, output equations, and timing in Moore and Mealy designs.
Circuit DesignDesign a 4-to-2 Priority Encoder with K-Maps
Derive priority-aware output bits and a valid signal for a four-input encoder.
Circuit DesignBuild a 1-to-4 Demultiplexer with K-Maps
Map data and select inputs to four mutually exclusive outputs, including enable and polarity variants.
K-Map SkillsFrom a Logic Word Problem to a Truth Table and K-Map
Translate a control-system statement into named variables, minterms, groups, and a verified expression.
Circuit DesignGate Fan-In Constraints: Turning K-Map Results into Circuits
Decompose wide terms and compare flat SOP, factored logic, and balanced gate trees.
MethodsK-Maps vs. FPGA LUTs: What Boolean Minimization Still Does
Learn when algebraic simplification affects LUT use and what to inspect after synthesis.
MethodsHow to Verify Boolean Equivalence and Debug a Wrong K-Map Answer
Use truth tables, XOR difference checks, and counterexamples to debug a candidate expression.
FundamentalsWhat Is a Karnaugh Map? A Complete Guide to Boolean Simplification
A complete starting point with a worked 4-variable solution, precise grouping rules, and examples from 2 to 6 variables.
TechniquesHow to Solve a 5-Variable K-Map and Read 6-Variable Maps
A complete five-variable minterm example, followed by the cross-tile adjacency rules for 5- and 6-variable maps.
MethodsQuine-McCluskey vs. Karnaugh Map: When to Use Each
When a tabulation method beats a visual map, and how the two relate.
FundamentalsSOP vs. POS Explained
Sum-of-products and product-of-sums, with worked conversions both directions.
MethodsPetrick's Method: Why Essential Prime Implicants Aren't Always Enough
How to finish a cyclic cover after selecting essential prime implicants.
TechniquesHandling Don't-Care Conditions in K-Maps
A commonly misunderstood topic, explained with worked examples.
TechniquesCommon Karnaugh Map Mistakes
Wraparound adjacency, invalid groupings, and missed prime implicants.
ReferenceBoolean Algebra Laws Cheat Sheet
De Morgan's, absorption, consensus, and the rest, in one place.
FundamentalsFrom Truth Table to Minimal Expression, Step by Step
A full worked walkthrough from raw truth table to final simplified form.
CircuitsNAND/NOR-Only Circuit Implementation from a Simplified Expression
Converting a minimal SOP/POS expression into a universal-gate-only circuit.
ReferenceKarnaugh Map vs. Veitch Diagram
A short history and terminology note on where the two names diverge.
FundamentalsWhat Are Minterms and Maxterms? A Complete Beginner's Guide
What they are, how they're numbered, and how they relate to each other — verified with a worked example.
FundamentalsCanonical SOP vs. Canonical POS: The Full (Non-Minimal) Forms Explained
The complete, unsimplified forms every minimization method starts from.
FundamentalsLogic Gates 101: AND, OR, NOT, NAND, NOR, XOR, XNOR Explained
The seven basic gates, with verified truth tables for each.
FundamentalsWhat Is Boolean Algebra? Why Digital Circuits Depend on It
What makes it different from ordinary algebra, and why it's what every circuit runs on.
FundamentalsCombinational vs. Sequential Logic: Where K-Maps Stop Being Useful
The honest boundary of what a K-map can and can't solve.
FundamentalsGray Code Explained: What It Is and Why K-Maps Depend on It
The single-bit-change property that makes K-map adjacency work at all, verified step by step.
K-Map SkillsK-Map Grouping Rules: The Quick-Reference Cheat Sheet
Every grouping rule in one scannable reference.
K-Map SkillsEssential vs. Non-Essential Prime Implicants, Explained Simply
What makes a group essential, and a clean example of a genuinely redundant one.
K-Map SkillsOverlapping Groups in K-Maps: Why It's Allowed and When to Use It
Why a cell belonging to multiple groups at once never causes double-counting.
K-Map SkillsHow Many Variables Can a Karnaugh Map Actually Handle?
The real practical limit, and what to use once you're past it.
K-Map SkillsReading a K-Map Wraparound: Diagrams for Every Edge Case
Left-right, top-bottom, and four-corner wraparound, each verified and diagrammed.
K-Map SkillsHow to Show Full Work on a K-Map for Exam Credit
What graders actually look for beyond a correct final answer.
MethodsThe Espresso Heuristic Logic Minimizer, Explained
The algorithm real chip design tools use for functions far too large for exact methods.
MethodsKarnaugh Maps vs. Truth Tables: Which Should You Actually Use?
They're not competing tools — here's what each is actually for.
MethodsManual K-Map Simplification vs. Software Tools: When Each Makes Sense
Why both matter, and the workflow that uses each one correctly.
MethodsAlgebraic Boolean Simplification Without a K-Map
A full step-by-step algebraic derivation, verified against the true minimal form.
MethodsTwo-Level vs. Multi-Level Logic Circuits
What multi-level factoring trades away and gains, verified with a worked comparison.
Circuit DesignHalf Adder vs. Full Adder: What Actually Changes
One extra input changes the entire structure of both outputs.
Circuit DesignDesigning a 4-to-1 Multiplexer with a K-Map
Verified at the full 6-variable level: the standard equation really is already minimal.
Circuit DesignDesigning a Binary Decoder Circuit with K-Maps
Why every decoder output is structurally guaranteed to already be minimal.
Circuit DesignHow an ALU Uses Boolean Logic to Do Arithmetic
An ALU is the same building blocks covered throughout this site, combined and selected between.
Circuit DesignDesigning a BCD-to-7-Segment Decoder From Scratch
All seven segments, independently minimized and verified.
Circuit DesignMulti-Output Boolean Minimization: Sharing Terms Across Functions
How several outputs can reuse product terms, and what to check before sharing logic.
Circuit DesignStatic Hazards in Logic Circuits: A K-Map and Consensus-Term Example
Why a correct minimized expression can glitch, and how a redundant term bridges a transition.
Circuit DesignBuilding a Traffic Light Controller's Combinational Logic
Splitting the sequential state-machine part from the genuinely combinational output logic.
Circuit DesignDesigning Code Converters: Binary, BCD, Gray, and Excess-3
BCD-to-Excess-3, minimized bit by bit, including a clean single-literal result.
Exam PrepKarnaugh Map Practice Problems With Full Solutions
Six verified problems, beginner to advanced, plus unlimited practice via the random example generator.
Exam PrepCommon Digital Logic Exam Mistakes on K-Map Questions
The process and notation errors that cost marks even with correct grouping technique.
Exam PrepGATE Exam Karnaugh Map Questions, Explained Step by Step
The question styles that ask for a number, not an expression — with two fully verified examples.
Exam PrepDigital Logic Design Interview Questions You Should Actually Know
The four question shapes that come up repeatedly, and what each is actually evaluating.
HistoryA Brief History of Boolean Algebra: From George Boole to Digital Circuits
How a 19th-century logician's work became the foundation of every digital circuit.
HistoryWho Was Maurice Karnaugh? The Story Behind the Map
The physicist, the year, and the Bell Labs context behind the map this whole site is built on.