Binary Numbers & Logic

Karnaugh Map Solver

Minimize SOP and POS forms for a two-, three-, or four-variable function.

Binary Numbers & Logic

Enter binary or code values

Deterministic local calculation with explicit word sizes and conventions
  1. 1EnterProvide the known values
  2. 2CalculateResults update automatically
  3. 3VerifyReview the details and units
Try an example

Prefixes 0b, 0o, and 0x are accepted where a field says “integer”. Underscores and visual spacing are ignored where appropriate. Your values stay in this browser.

Minimized Boolean function

0

Exact integer resultCalculated from the values currently entered

Understand and verify

Minimal SOP: 0

Minimal POS: 0

Minterms: None

Maxterms: 0, 1, 2, 3, 4, 5, 6, 7

K-map in Gray-code order:
row\col | 00 01 11 10
0      | 0 0 0 0
1      | 0 0 0 0

Don't-care terms: None

Variable order: A, B, C

Your entries are calculated in this browser and are not submitted to 365CALCS.COM.

Feedback

Understand the subject

What is a Karnaugh map?

A Karnaugh map arranges truth-table rows so adjacent cells differ by one bit, allowing valid power-of-two groups to simplify a function.

Use it to see why a minimized Boolean term covers several minterms.

The rule

Read the representation exactly

See the structure

What the bits are doing

Worked interpretation

Read the result in context

groups have size 1,2,4,8,…

Interpret with care

Important boundary

Adjacency wraps across map edges; arbitrary diagonal groups are not valid.

For a small base-two example, use the Binary Calculator.

Quick guide

How to use this calculator

  1. Choose the direction, operation, representation, or parity convention when one is provided.
  2. Enter the labelled values and an explicit word size, base, polynomial, or encoding option where required.
  3. Read the primary result together with its alternate representations and stated convention.

Calculation method

Apply the declared binary rule

Adjacent power-of-two groups eliminate variables that change within each group.

The calculator validates every digit against its numeral base, keeps integer and bitwise work exact with arbitrary-precision integers, and limits fixed-width operations to the selected word.

Worked example

Worked binary example

For three variables, minterms 1, 3, 5, 7 simplify to C.

Adjacent power-of-two groups eliminate variables that change within each group.

Supported inputs

Precision and limits

Input interpretation

Binary-only fields accept 0 and 1. General integer fields accept decimal plus 0b, 0o, or 0x prefixes. Base conversion supports bases 2 through 36.

Word size and output

Most fixed-width tools support 1–256 bits. Results expose signedness, truncation, parity, or encoding conventions whenever those choices change the meaning.

Local privacy

Calculation runs in the browser. Entered text, bit patterns, code words, and numeric values are not sent to analytics or third parties.

Calculator-specific rule

Indices use ordinary binary variable order with A as the most-significant bit. An empty minterm list represents the constant-zero function.