Skip to content
OneKitly
Sign up · Sign in

Logic Gate Simulator

Draws the gate diagram for a boolean expression and lets you flip each input to watch the signal travel through. Half-adder, multiplexer, parity and majority circuits are one click away.

Related tools

All Discrete maths & graphs tools →
RSA encryption simulatorWalk through the RSA public-key cryptosystem end to end with your own primes. Enter two primes p and q and a numeric message m: the simulator computes the modulus n = pq and the totient φ = (p−1)(q−1), picks or validates a public exponent e coprime to φ, derives the private exponent d = e⁻¹ mod φ, then encrypts c = mᵉ mod n and decrypts back mᵈ… = m — every step shown with big-integer arithmetic. The definitive way to see why RSA actually works.Soroban abacus simulatorAn interactive Japanese soroban you can actually use. Click the beads across thirteen columns — one heaven bead worth five and four earth beads worth one each — and the decimal value updates live beneath. Clear it, roll a random number, type a value to set the beads, or solve a quick addition, subtraction, multiplication or division and show the answer on the frame.Bitwise CalculatorAND, OR, XOR, NOT and shifts in binary, decimal or hex, at 8, 16, 32 or 64 bits, with the bit-by-bit diagram and the result in all three bases. Computed with BigInt, so the 64-bit answers are right where JavaScript's own 32-bit operators would silently truncate.Karnaugh Map (K-Map) SolverMinimize a boolean function with the Quine–McCluskey algorithm: enter minterms, maxterms or a truth table and get the minimal SOP or POS, prime implicants and literal count.Traveling Salesman SolverSolve the Traveling Salesman Problem from coordinates or a distance matrix: exact Held–Karp for up to 12 cities, nearest-neighbor + 2-opt beyond, with the tour order, total distance and a plot.Truth Table GeneratorBuilds the full truth table for up to 8 variables, with a column per sub-expression so you can see where a row turns. Classifies the formula as tautology, contradiction or contingency, lists the minterms and maxterms, and copies out as CSV, LaTeX or Markdown.Delaunay triangulation generatorPaste a set of 2D points and it triangulates them the Delaunay way — the triangulation that avoids thin sliver triangles, where no point lies inside another triangle's circumcircle. It runs the Bowyer-Watson algorithm in your browser and draws the mesh, with point, triangle and edge counts.Dijkstra shortest path calculatorEnter a weighted graph as edges ("A, B, 4" per line) and a source node: Dijkstra's algorithm returns the shortest distance and the exact path from the source to every reachable vertex. Works for directed or undirected graphs, accepts many edge formats, and flags unreachable vertices — ideal for routing, networks and pathfinding.

Logic Gate Simulator is free to use as often as you like, directly from this page. It sits under Discrete maths & graphs in our catalogue, alongside RSA encryption simulator and Soroban abacus simulator.

How to use it

  1. Open the tool — no signup or install needed.
  2. Enter your input or adjust the available options.
  3. Get your result instantly, then copy or download it.

Frequently asked questions

What does Logic Gate Simulator do?

Draws the gate diagram for a boolean expression and lets you flip each input to watch the signal travel through. Half-adder, multiplexer, parity and majority circuits are one click away.

When would I actually use this?

Anything modelled as points and connections: a shortest route, a network's capacity, a schedule with dependencies, or a circuit reduced to its logic.

What is the most common mistake?

Assuming a shortest path stays shortest when a weight changes sign. Negative edges break the greedy argument Dijkstra rests on, and the algorithm returns a confident wrong answer rather than an error.

How is Logic Gate Simulator different from RSA encryption simulator?

They sit next to each other but answer different questions: RSA encryption simulator is the one to open when you need it to walk through the RSA public-key cryptosystem end to end with your own primes. Enter two primes p and q and a numeric message m: the simulator computes the modulus n = pq and the totient φ = (p−1)(q−1), picks or validates a public exponent e coprime to φ, derives the private exponent d = e⁻¹ mod φ, then encrypts c = mᵉ mod n and decrypts back mᵈ… = m — every step shown with big-integer arithmetic. The definitive way to see why RSA actually works. Pick whichever matches what you're starting from — both are free.

Is there a tool for the next step?

Soroban abacus simulator is the closest one after this: An interactive Japanese soroban you can actually use. Click the beads across thirteen columns — one heaven bead worth five and four earth beads worth one each — and the decimal value updates live beneath. Clear it, roll a random number, type a value to set the beads, or solve a quick addition, subtraction, multiplication or division and show the answer on the frame.

What else is worth having open alongside it?

Bitwise Calculator and Karnaugh Map (K-Map) Solver — they come up in the same task often enough to be worth a second tab.

Where do the figures come from?

The algorithms are the textbook ones and their results are exact for the graph you enter. What varies is cost: several of these problems have no known efficient solution, so large inputs are answered by heuristic and the tool says when that is the case.

Further reading

All guides →
ExplainerThe Flat Pattern of a Cone Is a Sector, Not a CircleRoll a 50 mm cone 80 mm tall and its pattern is a 190.8° slice of a 94 mm circle. Flatten a nearly cylindrical lampshade and the pattern radius runs to 839 mm — the shallower the taper, the further away the apex.ExplainerA 1 % Drop Rate Does Not Mean One Hundred RunsAt 1 %, a hundred attempts give you 63.4 % — not certainty. Ninety per cent takes 230 attempts and ninety-nine takes 459, and more than a third of players are still empty-handed at a hundred.ExplainerFibonacci and the Golden RatioThe Fibonacci sequence adds each pair of terms to make the next; the ratio of neighboring terms homes in on the golden ratio φ ≈ 1.618. See how, and where the pattern turns up.ExplainerWhat Is a Z-Score? Standard Deviations Above the MeanA z-score is z = (x − μ) / σ — how many standard deviations a value sits from the mean. Learn how to compute it, read the standard normal curve, and turn it into a percentile.How-toHow to Find the Distance Between Two PointsUse the distance formula d = √((x₂−x₁)² + (y₂−y₁)²) to measure the straight-line distance between two points on a plane, with a worked example and the midpoint too.How-toHow to Calculate the Slope of a Line: Rise Over RunFind the slope of a line from two points with m = (y₂ − y₁) / (x₂ − x₁), and read what a positive, negative, zero, or undefined slope tells you.
Logic Gate Simulator — OneKitly