Zander/4-variable-simplifier
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

added README for new users

Browse source
This commit is contained in:
Alex Thannhauser 2025-07-17 11:59:03 -05:00
parent d50f32436d
commit 8e6e80a3b4
1 changed files with 18 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
README.md Normal file
View file

@ -0,0 +1,18 @@
# 4 variable boolean simplifier
Boolean simplifier uses brute-force to generate all simplest expression trees
for any 4-variable truthtable. It's pretty cool! And it has a repl! and it has
colors! It uses dynamic programming to run in reasonable time.
The python script takes 6 hours, the C program takes 30 seconds.
By default, the program will simplify/re-write the given expression(s) using
only "or", "and" and "not" operators. You can tell it to use all supported
operators ("xor", "xnor", "nor", "nand", etc.) using `-e`. Or, you can
explicitly control which operators to use using `-o`. Ternary takes a long
time, so it is not included in `-e`, you have to speficially request it using
`-o`. Out of the box, it'll have to build it's cache, you can use `-B` to
force a rebuild.