Visualizations of circuits made possible by Lelleck.

Features

• Solve any boolean expression and create CCNF(POS), CDNF(SOP)
• Minimize expressions using the Quine-McCluskey algorithm.
• Convert boolean expressions to only use NAND or NOR gates and draw them.

Setup & Usage

git clone --depth 1 https://github.com/MaxWolf-01/TruthTabler.git
pip install -r requirements.txt
cd src && python main.py

In modes with multiple available commands, type ? to show them. Go to the previous mode by typing exit. If prompted to enter variables, enter them as a string without seperators (e.g. abc). The availabe operator symbols for entering an expression can be found here

Examples

Solving an expression:

NAND/NOR conversion:

The above expression with only NAND gates:

The above expression with only NOR gates:

Warning

• This old and ugly code from my early days of programming - it works, but there are bugs like saving the circuits does not work on windows.
• Minimization for expressions with 7 variables and beyond may take some time (and memory), since it has exponential complexity (and the code is not optimized).